# Duality Transform Point Line: Explained
Duality Transform Point Line shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Map a point (a, b) to the line y = a x - b (or a similar convention) so incidence and above/below tests dualize to the opposite objects and many geometric problems swap roles.
## 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) per object.
## Common mistake
Mixing two duality conventions in the same proof, which flips the above/below relation.
## 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 job search and interview copilot.