# Longest Common Suffix Queries: Practice Notes
Longest Common Suffix Queries shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
For each query word, find the words[j] that shares the longest common suffix with it (tie: the shortest word, then the smallest index). Insert every word into a reversed trie, recording at each node the best (length, index) word that passes through it; query by walking the reversed query.
## 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 characters).
## Common mistake
Comparing every query to every word from the tail (O(n^2)) or using prefixes instead of 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.