# Short Encoding Of Words: Practice Notes

Short Encoding Of Words shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

A word can be absorbed into another if it is a suffix of that word. Insert words into a reversed trie (or sort reversed words) and sum lengths+1 of words that are not prefixes of another reversed word.

## 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(total length).

## Common mistake

Checking raw string suffixes without a trie and missing shared suffixes.

## 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 help for online coding assessments.