Medium problems that combine patterns:
Jump Game: - Reachability with greedy extension
Gas Station: - Circular array with running sum
Partition Labels: - Track last occurrences
Task Scheduler: - Frequency-based scheduling
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.