Log in Start studying

DSA learning path

Greedy & Intervals

Locally optimal choices, scheduling, merging and reachability.

Start with Can Attend Every Meeting?

Problems in this path

Can Attend Every Meeting?
Easy · Sort Intervals
Open
Merge Overlapping Intervals
Medium · Interval Merge
Open
Minimum Jumps to the End
Hard · Greedy Range Expansion
Open
Assign Cookies
Easy · Sorted Greedy Matching
Open
Gas Station Circuit
Medium · Greedy Restart
Open
Erase Overlapping Intervals
Medium · Earliest Finish Time
Open
Partition Labels
Medium · Last Occurrence Greedy
Open
Lemonade Change
Easy · Greedy Change Choice
Open
Minimum Candy Distribution
Hard · Two Direction Greedy
Open
Weighted Job Scheduling
Hard · Sort and Predecessor DP
Open

Read first

Greedy Algorithms and Interval Patterns

Know when a locally best choice is globally safe, prove it with an exchange argument, and master scheduling, merging and reachability patterns.