You have learned greedy patterns on arrays:
Jump Game: : Track furthest reachable.
Gas Station: : Find where cumulative deficit resets.
Boats: : Two-pointer pairing.
Candy: : Two-pass for bidirectional constraints.
Kadane's: : Reset negative prefix. In the next section, I will show you greedy optimization: fractional knapsack, job scheduling, and more. These array patterns form the foundation for more complex greedy algorithms.