Solution: Search Suggestions System
Explore how to implement an efficient search suggestions system using a trie data structure. Understand how sorting products and constructing a trie reduces search complexity, allowing quick prefix-based suggestions of up to three products. This lesson guides you through building and searching the trie step by step, enhancing your problem-solving skills for coding interviews involving strings and prefix matching.
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