# Kirkpatrick Seidel Ultimate Hull: Study Guide
Kirkpatrick Seidel Ultimate Hull shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Recursively compute upper-hull bridges between left and right median x-coordinates so the planar convex hull is found in the same time as integer sorting.
## 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 h) output-sensitive time.
## Common mistake
Choosing a bridge that is not tangent to both subhulls, which drops an extreme point from the global hull.
## 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.