Interval Scheduling

Back to Classic Problems (Greedy)

Problems involving scheduling tasks with time intervals to maximize utilization or minimize conflicts. Variants include interval scheduling maximization (most non-overlapping intervals), interval partitioning (minimum resources), and weighted interval scheduling.

algorithms greedy interval-scheduling