Medium data structure and algorithm practice puzzle.
Given the number of items n in a search space, return the best number of Grover iterations: pi / 4 x the square root of n, rounded down. So 16 items need 3. A normal search checks items one at a time, about n of them. Grover's algorithm needs only about the square root of n, and that's its famous speedup.
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 Sampler, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles