← Questions
Minimum add to make parentheses valid
0
I was asked this
No reports yet. Sign in to say where you were asked it.
Return the fewest parentheses to insert so a string of ( and ) becomes balanced, counting unmatched openers and closers in one pass.
No official answer yet. Write yours on the right and run it.
Nothing published yet.
Sign in to submit your code; every attempt is kept here.
Write and test your solution herePython in your browser, the question's tests level by level, every submission kept for you.Sign in to start coding