Topic: Greedy Algorithm Problem / Level: intermediate

Problem: Given an array of integers representing steps you can take forward, find the minimum number of jumps required to reach the last index.

Run the code to see the output here...