# Quickhull Recursive Extreme: Study Guide
Quickhull Recursive Extreme shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Find the farthest point from each current hull edge and recurse on the two sub-edges, discarding points inside the new triangle.
## 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
Expected O(n log n); worst-case O(n^2) on a thinly layered point set.
## Common mistake
Discarding a point that lies outside the new triangle because it was inside the previous enclosing slab.
## 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 coding interview assistant.