HardDesign: Search Autocomplete (Google)

What is the 'top-K cache at each node' optimization in a trie?

Tests your understanding of this concept.

Answer Options

ACaching recently accessed trie nodes
BPre-computing and storing the top 5 most frequent queries under each prefix node
CLimiting trie depth to K levels
DCaching the K most recently searched queries globally

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