Solution: Search Suggestions System
Explore how to build a search suggestions system by implementing a trie data structure to efficiently find up to three lexicographically smallest products matching each prefix of a searched word. Understand the step-by-step solution, complexity trade-offs, and how to optimize search time while managing space.
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