# Minimum Difference Between Largest And Smallest Value In Three Moves: Practice Notes

Minimum Difference Between Largest And Smallest Value In Three Moves shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may change up to three elements to anything. After sorting, the leftover window of n-3 elements should be as tight as possible, so try dropping 0..3 values from the left and the rest from the right; take the minimum range.

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

Always dropping the three largest, or treating n <= 4 as needing work instead of returning 0.

## 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 help for online coding assessments.