# Maximum Gap: Walkthrough

Maximum Gap shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

The maximum adjacent difference after sorting. Linear-time pigeonhole: put numbers into n-1 buckets between min and max (bucket size > 0 guaranteed if the gap is interesting); the max gap is the max of (next_bucket.min - prev_bucket.max), never inside a bucket.

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

## Common mistake

Sorting in O(n log n) (accepted by some judges but not the intended O(n) answer) or using bucket size 1 and blowing memory.

## 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 real-time AI interview assistant for live interviews.