Pregunta de entrevista de Zynga
How would you implement a LRU(Least Recently Used) cache?
Respuesta de la entrevista
Anónimo
15 nov 2012
I didn't know about approximate implementation using second chance or nth chance algorithm. I answered that it could be done in constant time using a hash table and a doubly linked list.