Skip to main content

Interval Scheduling

Learn Interval Scheduling (Greedy Algorithms, Data Structures & Algorithms) with worked examples, diagrams and interview questions. Free on JavaSchoolLab.

Minimum Removals to Make Intervals Non-Overlapping The flip side of Activity Selection: instead of asking "how many can I KEEP", ask "how many must I REMOVE" so the rest don't overlap. Both questions share the same greedy foundation (sort by end time), and the answer to one directly gives the other: removals = total - maxKept .

More lessons in Greedy Algorithms