Generate All Combinations of Valid Parentheses


Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Example:
Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"] #leetcode #medium
Public