Generate balanced parentheses
Detailed guide and Python implementation for the 'Generate balanced parentheses' problem.
Problem Statement
Write a function generate_parentheses(n) that generates all combinations of n pairs of well-formed (balanced) parentheses. Return the result as a sorted list of strings. A string of parentheses is balanced if every opening '(' has a corresponding closing ')' and they are properly nested.
- •1 <= n <= 8
Examples
n = 3
['((()))', '(()())', '(())()', '()(())', '()()()']
All 5 valid ways to arrange 3 pairs of parentheses.
n = 1
['()']
Only one way to arrange 1 pair of parentheses.
n = 2
['(())', '()()']
Two valid arrangements: nested or sequential.
Need a Hint?
Edge Cases to Watch
- Empty input structures
- Single element inputs
- Large numerical bounds
Ready to Solve?
Open the problem in PyRun's browser-based Python editor. Your code runs fully offline — no server required.
Recommended Python Resources
Expand your knowledge with related interactive tutorials, cheat sheets, and code comparisons.
Python Loops
Learn how to use Python loops to iterate over data. Master for loops, while loops, break, continue, and loop best practices with interactive examples.
How to Generate Random Numbers in Python
Learn how to generate random numbers in Python. Compare randrange, randint, and uniform float generation with seeding control.
Python String Methods
A complete reference guide for Python string manipulation. Master formatting, searching, splitting, replacing, and checking string properties.
Python vs JavaScript: Which Programming Language is Best?
A comprehensive comparison between Python and JavaScript. Explore syntax differences, performance, use cases (backend vs frontend), and coding examples.