Simple 3 liner solution - description is complicated than the actual problem
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\n    public int minRectanglesToCoverPoints(int[][] points, int w) {\n        Arrays.sort(points,(a,b)->a[0]-b[0]);\n\n        int c = 0, e=-1;\n\n        for(int point[] : points){\n            int x = point[0];\n            if(e<x){\n                c++;\n                e=x+w;\n            }\n        }\n\n        return c;\n    }\n}\n```
['Java']