Greedy Algorithms8 sections · 316 units
Open in Course

Medium Problems

Core practice

Medium problems that combine patterns:

1.1. Jump Game: - Reachability with greedy extension

2.2. Gas Station: - Circular array with running sum

3.3. Partition Labels: - Track last occurrences

4.4. Task Scheduler: - Frequency-based scheduling

5.5. Minimum Number of Arrows: - Interval covering variant These require recognizing which greedy criterion applies and why it is correct. These problems often combine two patterns: Jump Game uses greedy with reachability tracking, Task Scheduler combines frequency counting with heap scheduling.