Merge Intervals Pattern: Solve Scheduling Problems with Sort and Sweep

TLDR: Sort intervals by start time, then sweep left-to-right and merge any interval whose start ≤ the current running end. O(n log n) time, O(n) space. One pattern — three interview problems solved. 📖 When Two Meetings Overlap: The Scheduling Prob...