🎙 Free live masterclass · Sun, 29 Nov, 7:00 pm IST · Java Full Stack roadmap Register free →
Skills101
← Greedy Algorithms Quiz: all 8 questions

Greedy Algorithms Quiz · Question 6 of 8

What is the minimum number of jumps to reach the end of [2, 3, 1, 1, 4]?

What is the minimum number of jumps to reach the end of [2, 3, 1, 1, 4]?

Answer & explanation

Correct answer: 2

Jump from index 0 to 1, then from 1 (value 3) to the last index.

Can you get the rest right without peeking?

Take the timed Greedy Algorithms Quiz quiz free. Pass it to earn XP and count towards your certificate.

Start the quiz →