Search Suggestions System

Explore how to implement a search suggestions system that suggests up to three product names based on the prefix typed in a search word. Understand how to use trie data structures to efficiently find lexicographically ordered products sharing common prefixes. This lesson helps you design solutions for prefix-based search queries with constraints on the number of suggestions.

We'll cover the following...

Statement
Examples
Understand the problem
Figure it out!
Try it yourself

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 $\le$

...