Vidyalelo
Data Structure · Q197

Dynamic Programming in Data Structures

Programming · Data Structure · question 197

Q197

For any array, given that at most one element is non-zero, it is ALWAYS possible to reach the end of the array using minimum jumps.

A.
True
B.
False
Answer

Answer: Option B

Solution

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