Easy data structure and algorithm practice puzzle.
Given n qubits, return how many basis states they cover together. Each qubit doubles the count, so it's 2 to the power n. 0 qubits gives 1 and 3 qubits give 8. Start at 1 and double n times.
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 Shot Tile Exporter, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles