Back to Problems

Balanced Bracket Generator

Hard
backtracking recursion string
Problem Description

Generate all valid combinations of n pairs of balanced parentheses.

Input Format
A single integer n (number of pairs)
Output Format
All valid combinations, one per line, in lexicographical order
Constraints
1 ≤ n ≤ 8
Sample Input/Output
Input: 
3
Output: 
((()))
(()())
(())()
()(())
()()()
Explanation

All valid ways to arrange 3 pairs of parentheses

Solution Hints
  • Read carefully: Understand input/output format and constraints
  • Start simple: Think of brute force solution first, then optimize
  • Edge cases: Consider empty inputs, single elements, max constraints
  • Data structures: Choose arrays, hash maps, sets based on problem needs
  • Time complexity: Ensure your solution fits within time limits
  • Test examples: Verify logic with provided sample inputs
280
Points
2000ms
Time Limit
256MB
Memory Limit
Code Editor
Register to Submit
Register to Access Code Editor

Create a free account to solve coding problems and track your progress.

Register Now
Feedback