Easy data structure and algorithm practice puzzle.
Given a number n and a position i, return 1 if bit i is set, or 0 if it isn't. Bit 0 is the rightmost. Shift n right by i places, then AND it with 1. Flags, permission settings, and feature toggles are all read this 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 Login Presence Filter, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles