Dynamic programming – Minimum Jumps to reach to end | Algorithms
Given an array of non negative integers, start from the first element and reach the last by jumping. The jump length can be at most the value at the current position in the array. Optimum result is when you reach the goal in minimum number of jumps.
Post to Tumblr