How would you implement a LRU(Least Recently Used) cache?

Question

Utilisateur anonyme · Accepted Answer

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.

Zynga

Question d’entretien chez Zynga

Réponse à la question d'entretien

Entreprises suivies

Recherche d’emplois