Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: {((())), (()()), (())(), ()(()), ()()()} How do we solve this problem? Let’s start with base cases. n=0 : result set is empty (no solution) n=1 : result set is {()} […]
