Normal Hooman Approach easy!!!!
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 {\npublic:\n    int minRectanglesToCoverPoints(vector<vector<int>>& points, int w) {\n        int ans = 1;\n        sort(points.begin(),points.end());\n        int start = points[0][0];\n        for(int i =1;i<points.size();i++ ){\n            if(points[i][0] - start>w){\n                ans++;\n                start = points[i][0];\n            }\n        }\n            return ans;\n    }\n};\n```
['C++']