Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given an array of positive integers where each element represents the number of steps you can take forward from that index, find the minimum number of jumps to reach the end of the array.

Run the code to see the output here...