Here are easy greedy problems to solidify your foundation:
Assign Cookies: - Two-pointer matching
Lemonade Change: - Simulation with greedy change-making
Maximum Units on a Truck: - Sort by efficiency
Last Stone Weight: - Heap-based simulation
Can Place Flowers: - Linear scan with local decision These problems test single-pattern recognition: sorting for Assign Cookies, heap operations for Last Stone Weight. If you struggle with these, review the corresponding pattern sections before moving to medium.