Hard data structure and algorithm practice puzzle.
Given an array where each value is the farthest you can jump from that spot, return the FEWEST jumps to reach the last index. Walk the array and track the farthest you could reach with one more jump. When you reach the end of your current jump's range, take a jump and that farthest point becomes the new range. O(n), no queue needed.
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 Frame Budget Allocator, a pipeline you can run and download. See every Software Engineer project.
Browse all 576 puzzles