Hard data structure and algorithm practice puzzle.
Given readings and a maxDelta, return the length of the longest run where each reading is within maxDelta of the one before it. Walk through once with a current run length. If this reading is close enough to the last one, the run grows. If not, start a new run of 1. Keep the longest you see. An empty list is 0.
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 Intake Pipeline, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles