# Preparata Hong Divide Hull: Walkthrough
Preparata Hong Divide Hull shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Recursively compute left and right hulls by x-median split and then compute the two common tangents to merge them.
## 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 log n).
## Common mistake
Computing only one tangent (upper or lower) and treating the merge as done, which drops the other chain of hull 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 Linkjob AI.