Hard data structure and algorithm practice puzzle.
Given a string, return true if deleting at most one character makes it a palindrome. Walk two pointers inward. At the FIRST mismatch, there are only two options: skip the left character or skip the right one. Check whether either leftover piece is a palindrome. Still O(n).
Solve it three ways: snap the jigsaw pieces together, fill in the blanks, or type it from scratch against the tests. This one is free.
Every line of the solution comes with a note explaining why it is there, and a step by step replay shows the code running. At level 3, where you type it yourself, you can ask for an AI mock interview on this problem that ends with a hiring manager's scorecard.
Then grow it into a real project with the Software Engineer button: this puzzle becomes the Document Matcher, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles