Leetcode 1459. Rectangles Area
Given a set of axis-aligned rectangles, compute the total area covered by them without double-counting overlaps; the core challenge is correctly handling overlapping regions (often solved with sweep-line/interval merging or coordinate-compression techniques).
Asked at:
Microsoft
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid June, 2026
Microsoft
Senior
detect if two rectangles overlap, then compute area of intersection, generalized to 2D → 3D → N-D
Hello Interview Premium
Your account is free and you can post anonymously if you choose.