From ff1c438f582d7bb3ea90f37cf50ccd8f90c22f46 Mon Sep 17 00:00:00 2001
From: ZabihollahNamazi <zabihnamazi@gmail.com>
Date: Wed, 24 Jun 2026 16:11:52 +0100
Subject: [PATCH 1/2] lru cache done

---
 Sprint-2/implement_lru_cache/lru_cache.py | 68 +++++++++++++++++++++++
 1 file changed, 68 insertions(+)

diff --git a/Sprint-2/implement_lru_cache/lru_cache.py b/Sprint-2/implement_lru_cache/lru_cache.py
index e69de29..00f4044 100644
--- a/Sprint-2/implement_lru_cache/lru_cache.py
+++ b/Sprint-2/implement_lru_cache/lru_cache.py
@@ -0,0 +1,68 @@
+class CacheNode:
+    def __init__(self, key, value):
+        self.key = key 
+        self.value = value 
+        self.previous = None
+        self.next = None        
+
+class LruCache:
+    def __init__(self, limit: int):
+        if limit <= 0:
+            raise ValueError("Cache limit must be greater than 0")
+        
+        self.limit = limit
+        self.lookup = {}
+        self.head = None 
+        self.tail = None   
+
+    def _remove_node(self, node: CacheNode):
+        if node == self.head:
+            self.head = node.next
+        if node == self.tail:
+            self.tail = node.previous
+
+        if node.previous is not None:
+            node.previous.next = node.next
+        if node.next is not None:
+            node.next.previous = node.previous
+
+        node.next = None
+        node.previous = None
+
+    def _move_to_head(self, node: CacheNode):
+        node.next = self.head
+        node.previous = None
+        
+        if self.head is None:
+            self.head = node
+            self.tail = node
+        else:
+            self.head.previous = node
+            self.head = node
+
+    def get(self, key):
+        if key not in self.lookup:
+            return None
+            
+        node = self.lookup[key]
+        self._remove_node(node)
+        self._move_to_head(node)
+        return node.value
+
+    def set(self, key, value) -> None:
+        if key in self.lookup:
+            node = self.lookup[key]
+            node.value = value
+            self._remove_node(node)
+            self._move_to_head(node)
+        else:
+            new_node = CacheNode(key, value)
+            
+            if len(self.lookup) >= self.limit:
+                oldest_node = self.tail
+                if oldest_node is not None:
+                    del self.lookup[oldest_node.key]  
+                    self._remove_node(oldest_node)    
+            
+            self._move_to_head(new_node)
+            self.lookup[key] = new_node
\ No newline at end of file

From 9e6a2729da25aa8a824edea2ba16406ecef4d478 Mon Sep 17 00:00:00 2001
From: ZabihollahNamazi <zabihnamazi@gmail.com>
Date: Sat, 27 Jun 2026 12:11:02 +0100
Subject: [PATCH 2/2] added the linkedlist class

---
 Sprint-2/implement_lru_cache/lru_cache.py | 51 ++++++++++++++++++++++-
 1 file changed, 50 insertions(+), 1 deletion(-)

diff --git a/Sprint-2/implement_lru_cache/lru_cache.py b/Sprint-2/implement_lru_cache/lru_cache.py
index 00f4044..2d9fb37 100644
--- a/Sprint-2/implement_lru_cache/lru_cache.py
+++ b/Sprint-2/implement_lru_cache/lru_cache.py
@@ -3,7 +3,56 @@ def __init__(self, key, value):
         self.key = key 
         self.value = value 
         self.previous = None
-        self.next = None        
+        self.next = None
+
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+        self.tail = None
+
+    def push_head(self, value) -> Node:
+        new_node = Node(value)
+        
+        if self.head is None:
+            self.head = new_node
+            self.tail = new_node
+        else:
+            new_node.next = self.head
+            self.head.previous = new_node
+            self.head = new_node
+            
+        return new_node
+
+    def remove(self, node: Node) -> None:
+        if node is None:
+            return
+
+        if node == self.head:
+            self.head = node.next
+            
+        if node == self.tail:
+            self.tail = node.previous
+
+        if node.previous is not None:
+            node.previous.next = node.next
+            
+        if node.next is not None:
+            node.next.previous = node.previous
+
+        node.next = None
+        node.previous = None
+
+    def pop_tail(self):
+        if self.tail is None:
+            return None
+        
+        last_node = self.tail
+        value = last_node.value
+        
+        self.remove(last_node)
+        
+        return value        
 
 class LruCache:
     def __init__(self, limit: int):