Topic: Greedy Algorithm Problem / Level: intermediate
Problem: You are given an array of integers representing the number of steps that can be taken forward from each element. Find the minimum number of jumps required to reach the last element of the array.