Medium data structure and algorithm practice puzzle.
Given n, return every binary string of length n with no two 1s next to each other. Build the string one character at a time. You can always add a "0". You can add a "1" only if the last character wasn't a "1". The count of these strings follows the Fibonacci numbers.
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 Login Expression Evaluator, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles