AppliedAIPrep logoAppliedAI/Prep
Coding & DSA / 90

Generate all valid combinations of n pairs of parentheses.

Generating then filtering is O(2^(2n)) and wasteful. Backtracking with two counters builds only valid strings by enforcing the balance rule at every step. Here is the template and why the pruning conditions are exactly right.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

Generating then filtering is O(2^(2n)) and wasteful. Backtracking with two counters builds only valid strings by enforcing the balance rule at every step. Here is the template and why the pruning conditions are exactly right.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
DISCUSSION · 0

No comments yet — be the first to share your approach.