Leetcode 3262. Find Overlapping Shifts

Given a list of time intervals representing employee shifts, identify overlapping shift pairs or the actual overlapping time segments; the core challenge is detecting interval intersections efficiently (typically via sorting + sweep-line or two-pointer techniques) to handle many intervals and avoid O(n^2) comparisons.