Easy data structure and algorithm practice puzzle.
Given a number, return just its lowest 1 bit, with every other bit cleared. So 12 (1100) gives 4 (0100). n & -n does it in one step, because of how negative numbers are stored in binary. Fenwick trees use this exact trick to move between their indices.
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 Sample Flag Store, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles