Greedy Algorithms8 sections · 316 units
Open in Course

Hard Problems

Challenge yourself

Hard problems that push your skills:

1.1. Create Maximum Number: - Multi-step greedy with merging

2.2. Patching Array: - Range extension with doubling insight

3.3. IPO: - Two-constraint optimization with heaps

4.4. Minimum Cost to Hire K Workers: - Ratio-based selection

5.5. Candy: - Two-pass greedy with constraints from both sides These require combining multiple techniques and careful correctness proofs. These problems demand multi-step reasoning: IPO requires sorting by capital, then a heap for profit selection. Candy needs two passes to satisfy constraints from both directions.