Problemadvanced
Matching statistics
Also called matching statistics computation.
For each prefix of a pattern, the length of the longest substring of the text matching it.
For each prefix of a pattern, the length of the longest substring of the text matching it.
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 ZFZK7Q Edit this page History Report an error