Problemintro
Text segmentation
Decides whether a string without spaces can be split into valid words, solved by recursion with memoization or dynamic programming.
Decides whether a string without spaces can be split into valid words, solved by recursion with memoization or dynamic programming.
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 KKPM23 Edit this page History Report an error