Greedy Algorithms8 sections · 316 units
Open in Course

Easy Problems

Build confidence

Here are easy greedy problems to solidify your foundation:

1.1. Assign Cookies: - Two-pointer matching

2.2. Lemonade Change: - Simulation with greedy change-making

3.3. Maximum Units on a Truck: - Sort by efficiency

4.4. Last Stone Weight: - Heap-based simulation

5.5. 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.