Medium data structure and algorithm practice puzzle.
A fighting game rewards a combo: hits landed close together. Given the times in milliseconds when a player landed hits, in order, and a window w, return the most hits that fit inside any stretch where the last hit is at most w after the first. Use a sliding window that grows and shrinks: add one hit at a time, and whenever the newest hit is more than w after the oldest in the window, drop hits from the front until it fits again.
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 Entity Burst Detector, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles