Generate Parentheses — Rust Coding Problem
Difficulty: medium | Category: backtracking
Problem Description
Given `n` pairs of parentheses, write a function to generate all combinations of well-formed parentheses. **Approach:** Backtrack — add `(` if open count < n, add `)` if close count < open count.
Examples
Example 1
Input: n = 3
Output: ["((()))","(()())","(())()","()(())","()()()"]
Example 2
Input: n = 1
Output: ["()"]