Hard data structure and algorithm practice puzzle.
Given a string, return how many of its substrings are palindromes, counting every single letter. Expand from every possible center, on each letter and between each pair of letters, and add 1 for every matching step outward. That's O(n squared) with no extra memory.
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 Burst Detector, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles