Dsa
Recursion
Easy
Generate Parenthesis Combinations
Given an integer n representing the number of pairs of parentheses, write a program to generate all combinations of well-formed parentheses. Input an integer n and output all possible combinations as strings, each on a new line.
Example:
Input:
3
Output:
((()))
(()())
(())()
()(())
()()
Key concepts
recursionbacktrackingstrings
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