Refactor set method to improve existing cache handling

Author: Droid-An

Sprint-2/implement_lru_cache/lru_cache.py

@@ -9,11 +9,12 @@ def __init__(self, limit):
         self.storage = OrderedDict()
 
     def set(self, key, value):
-        if len(self.storage) < self.limit:
-            self.storage[key] = value
-        else:
-            self.storage.popitem(last=False)
-            self.storage[key] = value
+        if len(self.storage) == self.limit:
+            if key in self.storage:
+                self.storage.move_to_end(key)
+            else:
+                self.storage.popitem(last=False)
+        self.storage[key] = value
 
     def get(self, key):
         if key in self.storage: