Solution: Search Suggestions System
Explore how to build a search suggestions system by leveraging the trie data structure. This lesson guides you through sorting products, constructing a trie with prefix-based node lists, and performing efficient prefix searches to return top product suggestions after each character is typed.
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:
-
products.length -
products[i].length