# Minimum Area Rectangle II: Practice Notes
Minimum Area Rectangle II shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
A (possibly rotated) rectangle is two equal-length diagonals that share a midpoint and are not colinear. Map pair-of-points as candidate diagonals keyed by (midpoint, length) and compute area from the other two vectors.
## 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^2).
## Common mistake
Only considering axis-aligned sides — that is Minimum Area Rectangle I.
## 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 multilingual AI interview assistant.