Question d’entretien chez Intel Corporation
Asked to design LRU Cache memory structure
Réponse à la question d'entretien
Utilisateur anonyme
2 sept. 2020
linked list with hash map, each time the user access to an address the node is removed from list (if exist) and inserted to the top, if there are max number of addresses in cache you need to remove last node, hash table is for O(1) time comlexity for access to the right node