Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Example 1:
Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]
Language
C++
Domain
Backtracking
Type of Contribution
Code
Code of Conduct
[X] I follow Contributing Guidelines & Code of conduct.
Description
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Example 1: Input: n = 3 Output: ["((()))","(()())","(())()","()(())","()()()"]
Language
C++
Domain
Backtracking
Type of Contribution
Code
Code of Conduct