10Design and implement an LRU cache with O(1) get and put▼medium★ EssentialPalantirMetaxAI1 repliesunlockedThe single most-asked design-a-data-structure question in FDE loops. There's an interview-legal Python shortcut and a from-scratch version, and knowing when to offer which is half the grade.Open full answer →
11Merge K sorted lists into one sorted output▼mediumMetaGleanScale1 replies○ sign inK-way merge is the algorithm behind log aggregation, search-result merging, and LSM trees, which is exactly why FDE loops keep asking it. The heap version is table stakes; the tie-breaking detail is where candidates crash.Open full answer →
