Python: Beats 100%
Intuition\nwalk through the sorted list of x coordinates\n\n# Approach\nExtract the list of x coordinates, sort it in non-descdending order. Assign the left rec
# Intuition\nwalk through the sorted list of x coordinates\n\n# Approach\nExtract the list of x coordinates, sort it in non-descdending order. Assign the left rectangle boundary to x[0] initially, counter set to 1. Once x[i] exceeds (left+w) value, reassign x[i] -> left, counter++. Return counter in the end - total number of rectangles\n\n# Complexity\nBeats 100%\n\n# Code\n```python []\nclass Solution(object):\n    def minRectanglesToCoverPoints(self, points, w):\n        """\n        :type points: List[List[int]]\n        :type w: int\n        :rtype: int\n        """\n        xList = []\n        if len(points) == 0:\n            return 0\n        for point_i in points:\n            xList.append(point_i[0])\n        #\n        xList = sorted(xList)\n        count = 1\n        left = xList[0]\n        for x_i in xList:\n            if x_i > (left + w):\n                left = x_i\n                count+=1\n        return count\n        \n```
['Python']