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

B Greedy Algorithm

C Recursion

D Recursion and Dynamic Programming

E Any

Practice Next

More Basics of Computers Questions

One type of liquid contains 15% of benzene, the other contains 20% of benzene. A can is filled with 6 parts of the first liquid and 4 parts of the secon...
A rectangle with a length of 16 cm and breadth of 8 cm is rolled through its length to form a hollow cylinder. What will be the volume (in cm³) of the ...
In what ratio rice at 47 Rs/kg should be mixed with the rice at 28 Rs/kg so that selling mixture at Rs 45 per kg gives the profit of 25% if the quantity...
Find the third proportion of 14 and 28.
The current ages of Aman and Bishnu are in the ratio 3:4, respectively. Two years ago, Bishnu's age was 40% more than Aman's age ...
If p = 50 - q - r and pq + r(q + p) = 816 then find the value of (p² + q² + r²) .
The average weight of boys in a class is 65 kg, while the average weight of girls is 45 kg. If the overall average weight of the class is 50 kg and the ...
In what ratio should Darjeeling Tea costing Rs. 500 per kg mixed with Assam Tea costing Rs. 350 per kg, so that by selling the mixture at Ra. 480 per ...
If 120 liters of milk solution contains 60% milk, how much milk should be added to make the solution 80% milk?
The ratio of liquor and soda in a mixture of 70 liters is 3:2. How much liquor should be mixed to make the ratio 7:4?

Question

You are given an array of elements where each array

Solution

Download the app