diff --git a/Sprint-2/implement_lru_cache/linked_list.py b/Sprint-2/implement_lru_cache/linked_list.py
new file mode 100644
index 0000000..8974163
--- /dev/null
+++ b/Sprint-2/implement_lru_cache/linked_list.py
@@ -0,0 +1,54 @@
+class Node:
+    def __init__(self, key, value):
+        self.key = key 
+        self.value = value 
+        self.previous = None
+        self.next = None
+
+
+class LinkedList:
+    def __init__(self):
+        self.head = None
+        self.tail = None
+
+    def push_head(self, key, value) -> Node:
+        new_node = Node(key, 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) -> 'Node':
+        if self.tail is None:
+            return None
+        
+        last_node = self.tail
+        
+        self.remove(last_node)
+        
+        return last_node
\ No newline at end of file
diff --git a/Sprint-2/implement_lru_cache/lru_cache.py b/Sprint-2/implement_lru_cache/lru_cache.py
index e69de29..c329dda 100644
--- a/Sprint-2/implement_lru_cache/lru_cache.py
+++ b/Sprint-2/implement_lru_cache/lru_cache.py
@@ -0,0 +1,36 @@
+from linked_list import LinkedList, Node
+
+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.list = LinkedList()  
+
+    def get(self, key):
+        if key not in self.lookup:
+            return None
+            
+        node = self.lookup[key]
+        value = node.value
+        
+        self.list.remove(node)
+        self.lookup[key] = self.list.push_head(key, value)
+        return value
+
+    def set(self, key, value) -> None:
+        if key in self.lookup:
+            node = self.lookup[key]
+            self.list.remove(node)
+            self.lookup[key] = self.list.push_head(key, value)
+        else:
+            
+            if len(self.lookup) >= self.limit:
+                oldest_node = self.list.pop_tail()
+                if oldest_node is not None:
+                    del self.lookup[oldest_node.key]  
+                       
+            
+            self.lookup[key] = self.list.push_head(key, value)
\ No newline at end of file