✅🔥☠️Simple Code Python Solution beats 💯 ✅✅🔥
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    def minRectanglesToCoverPoints(self, points: List[List[int]], w: int) -> int:\n        points.sort(key = lambda x : x[0])\n        n = len(points)\n        cur = points[0][0]\n        res = 1\n        for x, y in points:\n            if x - cur > w:\n                res += 1\n                cur = x\n        return res\n                \n```
['Python', 'C++', 'Java', 'Python3']