# Valid Square: Study Guide
Valid Square shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Four points form a square iff among the six pairwise distances there are exactly two nonzero values (side and diagonal) with the right multiplicity, or four equal sides plus two equal longer diagonals. Reject duplicate points.
## 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(1).
## Common mistake
Accepting a rhombus that is not a square, or only testing axis-aligned edges.
## 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.