This commit is contained in:
optimisea
2024-12-02 18:02:50 +00:00
committed by GitHub

View File

@@ -91,7 +91,7 @@ Since the cache has limited capacity, we'll use a least recently used (LRU) appr
#### Cache implementation
The cache can use a doubly-linked list: new items will be added to the head while items to expire will be removed from the tail. We'll use a hash table for fast lookups to each linked list node.
The cache can use a doubly-linked list: new items will be added to the tail while items to expire will be removed from the head. We'll use a hash table for fast lookups to each linked list node.
**Clarify with your interviewer how much code you are expected to write**.