Problemintro
Subsequence checking
Also called is subsequence, subsequence test.
Decide whether one string is a subsequence of another, which a two-pointer scan solves in linear time.
Decide whether one string is a subsequence of another, which a two-pointer scan solves 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 REEV9S Edit this page History Report an error