Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are 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 steps required to jump to the last index.