#22

Generate Parentheses

medium · verified · 78.3% accepted · 23,151 likes · top 90%

string · dynamic programming · backtracking

⊣ practice⊣ quiz⊣ open on leetcode ↗

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: ["()"]

Solution