Greedy

Greedy algorithms build up a solution piece by piece, always choosing the next piece that offers the most immediate benefit. This strategy often yields optimal solutions for problems like jump games, scheduling, or partitioning, where local optimization leads to global optimization.