Problemcore
Counting distinct substrings
Also called number of distinct substrings.
Count the distinct substrings of a string, using the suffix array and LCP array.
Count the distinct substrings of a string, using the suffix array and LCP array.
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 N6YEV5 Edit this page History Report an error