EASY SOLUTION || BEATS 100% || C++ 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: O(N)\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```\nclass Solution {\npublic:\n    int minRectanglesToCoverPoints(vector<vector<int>>& points, int w) {\n        sort(points.begin(), points.end());\n        \n        if(points.size()==1) return 1;\n        int i=0, j = 1, ans2 =1;\n        while(j<points.size()){\n            if(abs(points[i][0]-points[j][0])<=w){\n                 j++;\n            }\n            else{\n                i = j;\n                j++;\n                ans2++;\n            }\n        }\n        return ans2;\n    }\n};\n```
['C++']