Problemcore
Suffix tree construction
Also called building suffix trees.
Build the suffix tree of a string in time linear in its length.
Build the suffix tree of a string in time linear in its length.
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 QNKKR5 Edit this page History Report an error