# Make Lexicographically Smallest Array By Swapping Elements: Walkthrough

Make Lexicographically Smallest Array By Swapping Elements shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

You may swap numbers whose absolute difference is <= limit, any times. Numbers that fall into the same connected component (after sorting, adjacent gaps <= limit) can be reassigned freely; sort each component and write the smallest available values back to the original positions of that component.

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

Swapping only once or only adjacent indices, or sorting the whole array (which may swap values farther than limit apart).

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