Dsa
Recursion
Warm-up
Generate Parentheses
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. Input format: A single integer n. Output format: A list of strings, each representing a valid combination of parentheses. Example: Input: 3 Output: ['((()))', '(()())', '(())()', '()(())', '()()()']
Key concepts
recursiongenerationbacktracking
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