Available question text
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.
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 3111. Minimum Rectangles to Cover Points
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source