Solution: Search Suggestions System

Explore how to build a search suggestions system by implementing a trie data structure for fast prefix matching. Learn the step-by-step approach to optimize search performance, understand the tradeoffs between time and space complexity, and apply this pattern to improve string storage and retrieval in coding interviews.

We'll cover the following...

Statement
Solution
- Naive approach
- Optimized approach using trie

Statement

Given an array of strings called products and a word to search, design a system that, when each character of the searched word is typed, suggests at most three product names from products. Suggested products should share a common prefix with the searched word. If more than three products exist with a common prefix, return the three product names that appear first in lexicographical order.

Return the suggested products, which will be a list of lists after each character of searched word is typed.

Constraints:

$1 \leq$ products.length $\leq 1000$
$1 \leq$ products[i].length $\leq 3000$

...