Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Follow-up: is there any other way to solve this besides backtracking?
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.