← All topics
Quiz: Design Search Autocomplete: questions with answers
10 questions, each with the answer and a short explanation.
Take the timed quiz + get a certificate →- Q1. Why store the top-k suggestions at every trie node?
- Q2. What does this print? (code)
- Q3. Why is the trie rebuilt from logs in batches instead of updated on every search?
- Q4. 10 million users make 10 searches a day, typing about 6 characters each. Roughly how many requests per second is that?
- Q5. What does this print? (code)
- Q6. What is debouncing in an autocomplete box?
- Q7. Why is sharding the trie strictly by alphabet ranges risky?
- Q8. Which prefixes benefit most from caching in a CDN or browser?
- Q9. What is the time to answer one lookup in a trie with top-k stored at each node?
- Q10. An offensive suggestion appears after a rebuild. What should the design include?