Solution: Search Suggestions System

Explore how to build a search suggestions system by using a trie data structure. This lesson helps you understand how to efficiently suggest up to three product names sharing a common prefix while optimizing search time compared to naive methods. Learn to create and traverse a trie to store sorted product data and perform prefix matching for incremental search queries.

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$
$1 \leq$ sum(products[i].length) $\leq 2 \times 10^3$

...