# Melkman Online Convex Hull: Practice Notes

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

## Key idea

Maintain the hull of a simple polygonal chain in a deque, popping the back or front whenever a new vertex turns the wrong way.

## 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) for a simple chain, processing vertices online.

## Common mistake

Applying the algorithm to a self-intersecting chain, for which the deque invariant does not hold.

## 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 multilingual AI interview assistant.