# Search Suggestions System: Explained

Search Suggestions System shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Sort the product list (or insert into a Trie that keeps up to three words per node). For each successive character of searchWord, binary-search the lower bound of the current prefix and collect up to three products that still match it.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (a heap or priority queue, Union-Find, interval scheduling, bitmask DP, a topological order, or a Trie) 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 log n + L * (log n + 3L)) sorted, or O(total chars) with a Trie.

## Common mistake

Re-filtering the whole catalog from scratch for every added character without using the sorted order or a Trie.

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