< Previous 　　　　　　　　　　　　　　　　 Next >

22. Generate Parentheses (Medium)

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

Related Topics

[String] [Dynamic Programming] [Backtracking]

Similar Questions

1. Letter Combinations of a Phone Number (Medium)
2. Valid Parentheses (Easy)