LeetCode 3111: Minimum Rectangles to Cover Points Solution

Master LeetCode problem 3111 (Minimum Rectangles to Cover Points), 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.

3111. Minimum Rectangles to Cover Points

Medium

Array Greedy Sorting

Problem Explanation

Explanation:

To cover all the given points with rectangles, we need to find the minimum number of rectangles needed such that each point is covered by at least one rectangle. We can achieve this by iterating through the points and determining the range of x-values covered by each rectangle.

Create a map to store the minimum and maximum y-values for each x-value encountered.
Iterate through all points and update the map with the minimum and maximum y-values for each x-value.
Finally, count the number of rectangles needed based on the ranges of y-values for each x-value.

Time Complexity: O(n), where n is the number of points. Space Complexity: O(n) for storing the ranges of y-values for each x-value.

Solution Code

class Solution {
    public int minRecntangles(int[][] points, int w) {
        Map<Integer, Integer> map = new HashMap<>();
        
        for (int[] point : points) {
            int x = point[0];
            int y = point[1];
            map.put(x, Math.max(map.getOrDefault(x, 0), y));
        }
        
        int minRectangles = 0;
        for (int y : map.values()) {
            minRectangles = Math.max(minRectangles, (y + w - 1) / w);
        }
        
        return minRectangles;
    }
}

Try It Yourself

Loading code editor...

Frequently Asked Questions

How to solve LeetCode 3111 (Minimum Rectangles to Cover Points)?

This page provides optimized solutions for LeetCode problem 3111 (Minimum Rectangles to Cover Points) 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 3111 (Minimum Rectangles to Cover Points)?

The time complexity for LeetCode 3111 (Minimum Rectangles to Cover Points) varies by solution. Check the detailed explanation section for specific complexities in Java, C++, and Python implementations.

Can I run code for LeetCode 3111 on DevExCode?

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

Back to LeetCode Solutions