# Steensgaard Unification Points To: Study Guide
Steensgaard Unification Points To shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Unify the points-to sets of any two pointers that are assigned to each other, giving an almost-linear but coarse pointer analysis.
## 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
Nearly O(n) with a union-find over equivalence classes of locations.
## Common mistake
Treating the assignment p = q as inclusion rather than unification, which silently turns the analysis into Andersen's and changes the cost.
## 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 best AI tool for coding tests and OAs.