# Minimum Absolute Difference: Walkthrough

Minimum Absolute Difference shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Return every pair of distinct elements whose difference equals the global minimum difference, sorted. Sort the array, compute the min adjacent gap, then collect every adjacent pair with that gap.

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

## Common mistake

Comparing non-adjacent values after sorting, which cannot be the minimum gap.

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