Most greedy problems fall into these categories:
1. Selection: : pick maximum items without conflict (activity selection)
2. Scheduling: : order tasks to minimize penalty or maximize profit
3. Interval: : merge, cover, or partition intervals
4. Exchange: : prove greedy by showing swaps do not hurt
5. 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.