LeetCode 2655: Find Maximal Uncovered Ranges Solution

Master LeetCode problem 2655 (Find Maximal Uncovered Ranges), a medium challenge, with our optimized solutions in Java, C++, and Python. Explore detailed explanations, test your code in our interactive editor, and prepare for coding interviews.

2655. Find Maximal Uncovered Ranges

Medium

Array Sorting

Problem Explanation

Explanation:

Given a list of ranges, we need to find the maximal uncovered ranges. An uncovered range is a continuous range of integers that does not intersect with any of the given ranges.

To solve this problem, we can follow these steps:

Sort the given ranges based on their start points.
Initialize a variable max_end to keep track of the maximum end point encountered while iterating through the ranges.
Iterate through the sorted ranges:
- If the current range's start point is greater than max_end + 1, then we have found an uncovered range from max_end + 1 to the start point of the current range.
- Update max_end to the maximum of its current value and the end point of the current range.
If max_end is less than the maximum integer value, then the range from max_end + 1 to the maximum integer value is also an uncovered range.

Time Complexity: O(nlogn) where n is the number of ranges due to the sorting process. Space Complexity: O(1) as we are using constant extra space.

Solution Code

import java.util.*;

class Solution {
    public List<List<Integer>> findMaximalUncoveredRanges(int[][] ranges) {
        List<List<Integer>> result = new ArrayList<>();
        
        Arrays.sort(ranges, (a, b) -> a[0] - b[0]);
        
        int maxEnd = Integer.MIN_VALUE;
        
        for (int i = 0; i < ranges.length; i++) {
            if (ranges[i][0] > maxEnd + 1) {
                List<Integer> uncoveredRange = new ArrayList<>();
                uncoveredRange.add(maxEnd + 1);
                uncoveredRange.add(ranges[i][0] - 1);
                result.add(uncoveredRange);
            }
            maxEnd = Math.max(maxEnd, ranges[i][1]);
        }
        
        if (maxEnd < Integer.MAX_VALUE) {
            List<Integer> lastRange = new ArrayList<>();
            lastRange.add(maxEnd + 1);
            lastRange.add(Integer.MAX_VALUE);
            result.add(lastRange);
        }
        
        return result;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 2655 (Find Maximal Uncovered Ranges)?

This page provides optimized solutions for LeetCode problem 2655 (Find Maximal Uncovered Ranges) in Java, C++, and Python, along with a detailed explanation and an interactive code editor to test your code.

What is the time complexity of LeetCode 2655 (Find Maximal Uncovered Ranges)?

The time complexity for LeetCode 2655 (Find Maximal Uncovered Ranges) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 2655 on DevExCode?

Yes, DevExCode provides an interactive code editor where you can write, test, and run your code for LeetCode 2655 in Java, C++, or Python.

Back to LeetCode Solutions