Update README.md
parent
fda859e4a4
commit
37dbdbadb7
|
@ -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**.
|
||||
|
||||
|
|
Loading…
Reference in New Issue