complexity analysis

Author: Mikiyas-STP

Sprint-2/implement_lru_cache/lru_cache.py

@@ -67,3 +67,5 @@ def set(self, key, value): #Insert/update value and handle eviction
                 # Remove least recently used node
                 tail = self.dll.pop_tail()
                 del self.cache[tail.key]
+#Time Complexity = O(1) since each operations have the same O(1) complexity
+#Total Space complexity is O(n) i.e. One node and one dictionary entry per cached item