✅✅ Beats 100% | Easiest solution | Beginner Friendly 💯
 # Intuition  \n\n\n# Approach\nSharing soon\n\n\n# Complexity\n- Time complexity: O(nlogn)\n\n\n- Space complexity: O(1)\n\n\n# Code\npython []\nclass Solution
<!-- # Intuition -->\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\nSharing soon\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity: O(nlogn)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```python []\nclass Solution:\n    def minRectanglesToCoverPoints(self, points: List[List[int]], w: int) -> int:\n        points.sort(key=lambda x: x[0])\n        i=points[0][0]\n        res=1\n        for point in points:\n            x,y=point\n            if x>i+w:\n                res+=1\n                i=x\n        return res\n```
['Sorting', 'Python3']