Problemintro
Generating balanced parentheses
Also called Generating Dyck words, Well-formed parentheses enumeration.
Enumerate all well-formed strings of n matched parenthesis pairs, which are counted by the Catalan numbers.
Enumerate all well-formed strings of n matched parenthesis pairs, which are counted by the Catalan numbers.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 05TNZG Edit this page History Report an error