Leetcode 3111. Minimum Rectangles to Cover Points

Given points (x,y) and rectangles that are vertical strips starting at y=0 with x-width at most w, find the minimum number of such strips needed to cover all points — which reduces to covering the points' x-coordinates with intervals of length ≤ w. This is the classic interval-covering/greedy pattern: choose minimal width-w x-intervals to cover all x positions.