Vidyalelo
Data Structure · Q68

Dynamic Programming in Data Structures

Programming · Data Structure · question 68

Q68

Consider the following array: 1, 3, 5, 8, 9, 2, 6, 7, 6 What is the minimum number of jumps required to reach the end of the array?

A.
1
B.
2
C.
3
Answer
D.
4

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board