Greedy succeeds when local optimal choices compose into global optimum, verified through exchange arguments or induction. The pattern clicks when you can prove that deviating from greedy choice never improves the solution. You'll reach for greedy in scheduling, selection, and "reach farthest" problems after verifying no counterexample exists. Understanding these concepts deeply helps you solve related problems faster.
Take time to internalize the pattern.