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.
Asked at:
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid March, 2026
Senior
Hello Interview Premium
Your account is free and you can post anonymously if you choose.