Search⌘ K
AI Features

Solution: Search Suggestions System

Explore how to implement a search suggestions system that returns up to three lex order product suggestions with each typed character. Learn to build and search a trie data structure for efficient prefix matching and understand the time and space complexity tradeoffs in this common coding interview problem.

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 an array of arrays after each character of searched word is typed.

Constraints:

  • 11 \leq products.length 1000\leq 1000
  • 11 \leq products[i].length 3000\leq 3000
  • 11 \leq sum(products[i].length) 2×103\leq 2 \times 10^3
...