Available question text
Given a list of axis-aligned rectangles, determine whether they exactly form a single rectangular region — i.e., their union equals one rectangle with no gaps or overlaps. Must efficiently verify coverage and non-overlap for up to 2·10^4 rectangles with large coordinate ranges.
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 391. Perfect Rectangle
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source