Divide Intervals Into Minimum Number of Groups
Sort intervals by start and keep the earliest-finishing group that is free; the number of groups equals the largest overlap.
Sort intervals by start and keep the earliest-finishing group that is free; the number of groups equals the largest overlap.