Problemcore
Counting balanced bracket sequences
Problem of counting balanced bracket sequences of length 2n, answered by the Catalan numbers or by dynamic programming with bounded depth.
Problem of counting balanced bracket sequences of length 2n, answered by the Catalan numbers or by dynamic programming with bounded depth.
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 60RDXN Edit this page History Report an error