About Intervals

Interval problems require sorting by start or end time and then processing overlaps, merges, or gaps. These problems cover merging overlapping intervals, inserting new intervals, meeting room scheduling, and finding minimum platforms. The key technique is sorting followed by a linear scan.

Practice 0 interactive coding problems with step-by-step execution visualization.