← Back to questions
HackWithInfy• Prep

Generate Parentheses

Difficulty
Medium
Acceptance Rate
78.3%

Problem Statement

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

Similar Questions

Letter Combinations of a Phone NumberMediumValid ParenthesesEasyCheck if a Parentheses String Can Be ValidMedium