Search⌘ K
AI Features
Home
Courses
Grokking the Coding Interview Patterns in C#

Solution: Search Suggestions System

Explore how to design a search suggestions system using a trie to efficiently find product names sharing prefixes with a searched word. This lesson helps you understand building and searching tries, optimizing time complexity over naive methods by balancing sorting, insertion, and prefix searching. You will learn step-by-step trie construction and how to retrieve relevant suggestions after each character input.

We'll cover the following...

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:

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