Hard data structure and algorithm practice puzzle.
Given a string, return how many ways you can cut it into pieces that are all palindromes. Try every possible first piece. If it reads the same both ways, recurse on the rest. Reaching the end counts as 1 way. Every single letter is a palindrome, so there's always at least one way.
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 Packet Replay Log, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles