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.