The language indicates that slides 3 and 4 should have the same array: “The example above perfectly illustrates that the greedy approach doesn’t work. However, the array is not unwinnable. Have a look at the slides below”.
However, slide 3 has array [2, 4, 1, 1, 0, 2, 3] and slide 4 has array [1, 4, 1, 1, 0, 2, 3].
Is this saying that the non-greedy approach chooses to only advance 1 from index 0 instead of the maximum 2?
Type your question above this line.
Course: https://www.educative.io/collection/10370001/5474278013140992
Lesson: https://www.educative.io/collection/page/10370001/5474278013140992/4885010077188096