Question Details
Design and implement a data structure for LRU (Least Recently Used) cache. Implement the operations get and put with O(1) average time complexity. get(key) - Get the value (will always be pos
Full Details
🔒
Unlock all Citadel questions
Full insider details, leaked discussions, and candidate experiences.
or every company, $100/year →