Problemadvanced
Longest previous factor
Also called LPF array, longest previous factor problem.
For each position, the length of the longest prefix that occurs earlier; gives LZ77 factorization in linear time.
For each position, the length of the longest prefix that occurs earlier; gives LZ77 factorization 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 H8NZFT Edit this page History Report an error