Problems

17. Generate Parentheses

MediumBacktrackingAmazonGoogleMicrosoft

Given n pairs of parentheses, generate all combinations of well-formed parentheses.

Example 1:

Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]

Example 2:

Input: n = 1
Output: ["()"]

Constraints:

  • 1 <= n <= 8
Core code mode
● Auto-savedLine 1, column 1