# Offline Rectangle Union Area Sweep: Study Guide

Offline Rectangle Union Area Sweep shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sweep vertical edges left to right and maintain the union length of active y-intervals in a segment tree of coverage counts.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n log n) after compressing y-coordinates.

## Common mistake

Storing lengths on a segment tree of points instead of unit intervals, which off-by-ones the area.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.