Simple python solution
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        X = sorted([p[0] for p in points])\n        ans = 1\n        l = X[0]\n        for i in range(len(X)):\n            if X[i] - l > w:\n                ans += 1\n                l = X[i]\n        return ans\n\n```
['Python3']