# Rearrange String K Distance Apart: Walkthrough
Rearrange String K Distance Apart shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
Put character counts in a max-heap. Repeatedly pop up to k distinct characters (or whatever remains), append them, and park each one in a cooldown queue until its next valid index, then push it back.
## Steps to say out loud
1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 Σ).
## Common mistake
Greedy adjacent swaps like reorganize-string (k=2) without a cooldown of k, which can place the same letter too soon.
## 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 try it free.