Dsa
Recursion
Hard
Balanced Parentheses Combinations
Generate all combinations of well-formed parentheses given 'n' pairs. The input consists of a single integer 'n'. For example, for input '3', the output should be '((())) (()()) (())() (()())'.
Key concepts
recursionbacktrackingcombinatorics
Practise this out loud — free
Start a mock interview on THIS exact question — a voice AI interviewer opens with it, pushes back like a real onsite, then hands you an instant scorecard.
🎙 Practise this question now