Easy Problemsminimizationlinear
Jump Game
Given an array where each value is the farthest a jump from that position can reach, and starting at the first index, find the minimum number of jumps needed to reach the last index.
Do this lesson first: coin changeThe full breakdown and animated table for this problem are still being written. In the meantime, run the four questions on it yourself — that is the whole exercise.