# Steensgaard Versus Andersen Tradeoff: Interview Notes

Steensgaard Versus Andersen Tradeoff shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Explain when a unification-based pointer analysis is accurate enough versus when inclusion constraints are worth the extra cost.

## 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

Near-linear versus quadratic; pick unification for compilers and inclusion for verification-style clients.

## Common mistake

Claiming the two analyses always produce the same points-to sets; they diverge as soon as a pointer is assigned two distinct targets.

## 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 this tool.