New Click here to enroll in UIICL SO Finance and Investment Course

    Register

    Question

    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?

    A Dynamic Programming Correct Answer Incorrect Answer
    B Greedy Algorithm Correct Answer Incorrect Answer
    C Recursion Correct Answer Incorrect Answer
    D Recursion and Dynamic Programming Correct Answer Incorrect Answer
    E Any Correct Answer Incorrect Answer

    Solution

    The correct answer is D

    Practice Next