Problemintro
Palindrome recognition
Also called palindrome testing, palindrome check.
Decide whether a given string is a palindrome, in linear time with two pointers.
Decide whether a given string is a palindrome, in linear time with two pointers.
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 TM3QDZ Edit this page History Report an error