Tripadvisor Interview Question
Implement LRU cache with add and fetch with O(1) Time Complexity
Interview Answer
Anonymous
Nov 17, 2016
Doubly linked-list with HashMap.
Implement LRU cache with add and fetch with O(1) Time Complexity
Anonymous
Doubly linked-list with HashMap.
Check out your Company Bowl for anonymous work chats.