Topic: Greedy Algorithm Problem / Level: intermediate
Problem: Given an array of integers representing steps, where each element indicates the maximum number of steps you can take from that index, find the minimum number of jumps to reach the end of the array.