Greedy Algorithms8 sections · 316 units
Open in Course

Section Recap

What we learned

You have learned interval manipulation:

1.1. Merge intervals: : Sort by start, track last interval, merge when overlap.

2.2. Insert interval: : Three phases: before, merge, after.

3.3. Intersections: : Two-pointer on sorted lists.

4.4. Remove covered: : Sort by start (end desc), track max end.

5.5. Cover range: : Greedy extension, always pick furthest. Good job on finishing this section. Intervals are a favorite interview topic and you are ready.