Medium data structure and algorithm practice puzzle.
Given a sorted array and a target, return how many times the target appears. Binary search for the first copy and for the last copy. If there's no first copy, return 0. Otherwise, it's last - first + 1. Two O(log n) searches beat counting every item once the array is big.
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 Quantile Rig, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles