# Chan Algorithm Convex Hull: Explained

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

## Key idea

Guess the hull size H as successive squares and run a Jarvis-style march over mini-hulls of size H, restarting with a larger guess on failure.

## 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) with a very simple grouping-and-march structure.

## Common mistake

Advancing the march to a mini-hull tangent that is not the true next hull vertex, which can loop or miss a vertex.

## 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 job search and interview copilot.