# Groups Of Strings: Walkthrough

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

## Key idea

Strings are connected if they differ by one added, deleted, or replaced character, or share the same character set after a deletion? (the problem connects words whose XOR-of-presence-bitmasks differ by one bit-flip or a bit move). Union-Find on 26-bit masks: union each mask with masks that delete one letter or replace one letter.

## 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 * 26^2).

## Common mistake

Comparing every pair of strings with edit distance (too slow) or ignoring that multiple words can share a mask.

## 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 learn more.