Loop

Intervals

Sorting, merging, and sweeping over ranges of time.

0 of 5 lessons complete · 109 min total

Start module
  1. Intervals: Sort First, Then SweepThe overlap test (a.start <= b.end AND b.start <= a.end), sort-by-start for merging vs sort-by-end for keeping the most, and start/end event sweeps for counting concurrency.Lesson · 16 minNot completed
  2. The Sweep LineMerging and room-counting as one animation.Animation · 10 minNot completed
  3. Practice: Insert & MergeThree-phase insertion, sort-and-merge, and greedy earliest-end removal.medium×33 problems · 0 solvedPractice · 35 minNot completed
  4. Practice: Rooms & QueriesAdjacent overlap checks, concurrent-meeting counting, and heap-assisted interval queries.easymediumhard3 problems · 0 solvedPractice · 40 minNot completed
  5. Intervals CheckpointOverlap conditions, sort-key selection, and event-sweep counting.Checkpoint · 8 minNot completed