Problemcore
Counting distinct subsequences
Also called number of distinct subsequences.
Count the distinct subsequences of a string, not counting repeated index choices that yield equal strings.
Count the distinct subsequences of a string, not counting repeated index choices that yield equal strings.
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 DVAPVH Edit this page History Report an error