Leetcode 3268. Find Overlapping Shifts II

Given multiple employees’ shift intervals, compute all time spans where shifts overlap (and optionally which employees or how many) — a hard variant that requires efficiently finding interval intersections and aggregating overlaps for large inputs, typically solved with a sweep-line or interval-tree approach.