Greedy Algorithms8 sections · 316 units
Open in Course

What is Next

Looking ahead

You have learned activity selection and its variants:

1.1. Maximum non-overlapping activities

2.2. Minimum intervals to remove

3.3. Minimum arrows to burst balloons

4.4. Meeting rooms (checking overlap and counting rooms) In the next section, I will show you more interval problems: merging intervals, inserting intervals, and interval covering. The patterns build on what you learned here. Sorting by end time is your go-to strategy for non-overlapping problems.