Problemadvanced
Shortest unique substring
Also called shortest unique substring at each position.
For each position, find the shortest substring starting there that occurs only once.
For each position, find the shortest substring starting there that occurs only once.
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 AEY8AA Edit this page History Report an error