Leetcode 391. Perfect Rectangle

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 391. Perfect Rectangle

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact