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.