From 37dbdbadb758eae3ea0fc8f4b7633561f29f0dd5 Mon Sep 17 00:00:00 2001
From: optimisea <34330974+optimisea@users.noreply.github.com>
Date: Sat, 30 Mar 2019 18:49:36 -0500
Subject: [PATCH] Update README.md

---
 solutions/system_design/query_cache/README.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/solutions/system_design/query_cache/README.md b/solutions/system_design/query_cache/README.md
index 6d97ff2d..dc86d22a 100644
--- a/solutions/system_design/query_cache/README.md
+++ b/solutions/system_design/query_cache/README.md
@@ -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**.