# Chan Gift Wrapping Convex Hull: Practice Notes

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

## Key idea

Run Jarvis march but only against a sample of sqrt(n)-sized mini-hulls, then restart with a larger sample if the guessed size was too small.

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

## Common mistake

Forgetting to double the guessed h, which can degrade to quadratic restarts.

## 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 https://www.linkjob.ai/.