How would you implement an LRU Cache (LRU - Least Recently Used). What would your data structure look like.
This was also a whiteboard problem.

Question

How would you implement an LRU Cache (LRU - Least Recently Used). What would your data structure look like.
This was also a whiteboard problem.

Sigiloso · Accepted Answer

The answer is to use a LinkedHashMap or a similar data structure because it allows O(1) on all needed operations.

anonymous · Answer

LinkedHashMap works only if an item is used only once, so you need to implement your own O(1) insertion, deletion and search that are tailored to LRU.

Tripadvisor

Pergunta de entrevista da empresa Tripadvisor

Respostas da entrevista

Empresas seguidas

Buscas de vagas