Given n pairs of parentheses, return every combination of well-formed parentheses.
You can return the combinations in any order.
Examples
Example 1
- Input
- n = 3
- Output
- ["((()))", "(()())", "(())()", "()(())", "()()()"]
Example 2
- Input
- n = 1
- Output
- ["()"]
Constraints
1 <= n <= 8