Loading practice questions
You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. You have to find the minimum number of jumps that are required to reach the end of the array. Which of these methods can be used to solve the problem?
Correct Answer: D — Recursion and Dynamic Programming
Explanation:
Both recursion and dynamic programming can be used to solve minimum number of jumps problem.