Medium data structure and algorithm practice puzzle.
Given an array of part strengths and a threshold, return how many parts are below the threshold. A part exactly on the threshold passes. Walk the array once and count. Decide the boundary before you write the comparison, because that's where these go wrong.
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 Event Range Service, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles