mediumBacktrackingDynamic ProgrammingString 0 views
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
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
Hints
No hints yet.
Companies
No companies reported yet.
Discussion
Sign in to join the discussion.
Loading discussion...
Test results
No test cases yet.