CS fundamentals and algorithms
Trie based autocomplete
You need search autocomplete that works offline: 500,000 candidate words, and on every keystroke you return the top 10 within 16ms. How do you design the data structure?
Up next
CS fundamentals and algorithmsShort answerBasics
You're building name search over a list of 10,000 contacts. How do linear search and sort…
#trie #search
iOS system designShort answerBasics
Design the search screen of a music app: autocomplete while typing, a results list, and r…
#autocomplete #search
CS fundamentals and algorithmsShort answerBasics
Your app writes a network log file. Each line has the format userID(4 digits) pageName st…
#top-k
ArchitectureMultiple choiceAdvanced
In this Coordinator implementation, LoginCoordinator stays in memory after the login flow…
#memory