Solution: Search Suggestions System
Explore how to design a search suggestions system using a trie data structure to efficiently match prefixes and suggest up to three product names. Learn to optimize search with sorting and trie implementation, analyze time and space complexities, and apply prefix matching for each typed character in the search word.
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