Your Dashboard
Interview Coaching
Learn
System Design
ML System Design
Code
Behavioral
Salary Negotiation
Interview Guides
Search
⌘K
Get Premium
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.
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Comments
Hello Interview Premium
Your account is free and you can post anonymously if you choose.