# Minimum Unique Word Abbreviation: Explained

Minimum Unique Word Abbreviation shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Enumerate abbreviations of the target (bitmasks of kept letters). An abbreviation is valid if it matches no dictionary word; pick the shortest (then lex-smallest) valid one.

## 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(2^L * |dict|).

## Common mistake

Greedy dropping of middle letters, which can collide with a dictionary word.

## 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 Linkjob.ai.