Generate All Parentheses Combinations

Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered well-formed if it is balanced, meaning each left parenthesis has a matching right parenthesis and the matched pairs are correctly nested.

Example:

Input:

N = 3

Output:

[("((()))"), "(()())", "(())()", "()(())", "()()()"]

Explanation:

For N = 3, the possible combinations are: "((()))", "(()())", "(())()", "()(())", "()()()".

Constraints:

1

Question

Generate All Parentheses Combinations

Given an integer N, your task is to create all possible valid parentheses configurations that are well-formed using N pairs. A sequence of parentheses is considered well-formed if it is balanced, meaning each left parenthesis has a matching right parenthesis and the matched pairs are correctly nested.

Example:

Input:

N = 3

Output:

[("((()))"), "(()())", "(())()", "()(())", "()()()"]

Explanation:

For N = 3, the possible combinations are: "((()))", "(()())", "(())()", "()(())", "()()()".

Constraints:

1 <= N <= 11
Time Limit: 1 sec.

Accepted Answer

Generate all possible valid parentheses configurations with N pairs.

Use backtracking to generate all possible combinations of parentheses.
Keep track of the number of open and close parentheses used.
Add '(' if there are remaining open parentheses, and add ')' if there are remaining close parentheses.