Most greedy problems fall into these categories:
Selection: : pick maximum items without conflict (activity selection)
Scheduling: : order tasks to minimize penalty or maximize profit
Interval: : merge, cover, or partition intervals
Exchange: : prove greedy by showing swaps do not hurt
Construction: : build solution piece by piece (Huffman coding) Recognizing the category helps you find the right approach. I will cover each in the following sections.