LeetCode 22 -- Generate Parentheses

Problem

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 \le n \le 8\)

Solution