# K Similar Strings: Interview Notes
K Similar Strings shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
s1 can be made into s2 by swapping any two letters; k-similar is the min swaps. Only positions where s1[i]!=s2[i] matter. BFS on the current string: swap the first mismatch with each later character that belongs there.
## 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(states * n), states are the mismatch permutations.
## Common mistake
Using a character-count difference (anagram distance) which undercounts because swaps are of any two letters, not just mismatched pairs — actually any two letters are allowed, but the optimal sequence only swaps mismatches. Greedy pairwise swaps can be suboptimal.
## 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 interview assistant.