InterviewDB Question

MongoDB SWE Phone - LRU Cache

Question Details

Problem Design and implement a Least Recently Used (LRU) cache supporting O(1) get and put operations using a hash map and doubly linked list. Likely LeetCode equivalent LeetCode 146 - LRU Cache. Tags hash_table,linked_list,design,swe

Full Details

🔒

Unlock all MongoDB questions

Full insider details, leaked discussions, and candidate experiences.

or every company, $100/year →

About This Question

This is a reported interview question from a mongodb interview during the phone round.

It covers the following topics: Linked List, Coding, Hash Table, Phone .