22. Generate Parentheses

Medium
String
Dynamic Programming
Backtracking

Description

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

Statistics

Acceptance
78.1%
Submissions
3,467,179
Accepted
2,706,823