HardDesign: Search Autocomplete (Google)
What is the time complexity of finding top-5 suggestions for a given prefix in an optimized trie with top-K caching?
— Tests your understanding of this concept.
Answer Options
AO(N) — must scan all queries
BO(L) — traverse L characters to reach prefix node, then return cached top-5
CO(K log N) — sort K candidates
DO(N log N) — sort all queries
Want to see the correct answer?
Get the answer with a detailed explanation, plus practice 22+ more Design: Search Autocomplete (Google) questions with adaptive quizzes and timed interviews.
See the Answer on Guru Sishya →This question is from the Design: Search Autocomplete (Google) topic (System Design Cases).
More Design: Search Autocomplete (Google) Questions
What data structure is primarily used for efficient prefix-based autocomplete?
HardWhy is SQL LIKE 'app%' insufficient for autocomplete at Google scale?
HardWhat is the 'top-K cache at each node' optimization in a trie?
HardHow do you update the trie when query frequencies change, without causing serving errors?
HardWhy should autocomplete requests be debounced on the client side?
Hard