Solution: Search Suggestions System
Explore how to build a search suggestions system by leveraging the trie data structure for efficient prefix matching. This lesson guides you through creating and inserting product data in a trie, searching for prefixes to suggest up to three lexicographically ordered products, and understanding the time and space complexities involved in optimizing search performance.
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