Generate Valid Parentheses

Problem

Return valid combinations of n pairs of parentheses in lexicographic order.

Examples

Example 1

Input: 3

Output: ["((()))","(()())","(())()","()(())","()()()"]

Example 2

Input: 1

Output: ["()"]

Input and output use JSON-compatible values. For linked-list and tree questions, arrays represent the node structure as described above. Your code should implement solve(input).

Write your solutionImplement solve(input). Your draft is saved in this browser.

Compiler

How to solve Generate Valid Parentheses

Return valid combinations of n pairs of parentheses in lexicographic order. Never close more parentheses than you have opened. The reference implementation illustrates this approach; check the example and edge cases.

Time and space complexity

O(Cn·n) output time, where Cn is the nth Catalan number.

Practise and improve

Choose JavaScript, TypeScript or Python, complete the starter code, then select Run Tests. Request a hint when you need guidance, or choose View solution and confirm if you would like to study the reference implementation.