# Similar String Groups: Interview Notes

Similar String Groups shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two strings are similar if they differ in at most two positions (a swap); Union-Find every similar pair and count components.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (graph BFS, Dijkstra, Union-Find, or interval DP) and why a simpler scan fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n^2 L).

## Common mistake

Requiring the strings to be equal, which under-counts groups that are one swap 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 this tool.