Problemcore
Compressing a string by its smallest period
Also called Compressing a string.
Problem of finding the shortest string whose repetition forms the given string, derived from the prefix function in linear time.
Problem of finding the shortest string whose repetition forms the given string, derived from the prefix function in linear time.
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 KQB4X1 Edit this page History Report an error