# Overmars Van Leeuwen Hull: Interview Notes
Overmars Van Leeuwen Hull shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Store the convex hull in a balanced tree of concatenable hulls so insertions and deletions update only the joining tangents along one path.
## 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(log^2 n) insertions and deletions.
## Common mistake
Recomputing a tangent from scratch at every node instead of reusing the stored bridge, which silently becomes quadratic.
## 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 interview assistant.