# Chan Algorithm Dynamic Convex Hull: Study Guide

Chan Algorithm Dynamic Convex Hull shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Rebuild hulls over exponentially growing prefixes so each insertion or deletion touches a logarithmic number of static hulls that can be queried by binary search.

## 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) amortized queries with periodic rebuilds.

## Common mistake

Rebuilding every prefix after each update, which loses the logarithmic grouping.

## 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 official website.