Given n
pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Example 1:
Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"]
Example 2:
Input: n = 1 Output: ["()"]
Constraints:
1 <= n <= 8
This question is a good example of Recursion with Backtracking. if you know how we can leverage the concept of backtracking then it will be an easy question to be solved.
Time Complexity: O(2^n)
Space Complexity: O(n)