Leetcode 2655. Find Maximal Uncovered Ranges

Given a set of possibly overlapping, unsorted intervals within a domain (e.g., [lower, upper]), compute the maximal uncovered ranges—the complement segments not covered by any interval. This requires merging/sorting the input intervals and then finding the gaps (including boundary gaps) between merged intervals.