Search Suggestions System

LeetCode 1268 • Medium • Tries • Anduril

products sorted; for each growing prefix of searchWord, return up to 3 lexicographically smallest matches.

TimeO(n log n + m·n)

SpaceO(1)

Suggestion

step—

note—

Speed:

Ready

Press Play to walk the algorithm.

Whiteboard

Size:3

Type It

suggestedProducts(products, searchWord) — list of ≤3 suggestions per prefix.

═══ SEARCH SUGGESTIONS (LC 1268) ═══

PATTERN ▸ sort + prefix scan / trie

① products.sort()

② for each prefix, collect first 3 startsWith

or binary search lower_bound

your implementation

Verify: