From c2e7a08bcddeb7de8afccf8bee6ab4bdf41addde Mon Sep 17 00:00:00 2001 From: Ahmad Hmedan Date: Fri, 2 Oct 2026 23:29:33 +0100 Subject: [PATCH 1/4] feat: implement push_head for linked list --- Sprint-2/implement_linked_list/linked_list.py | 25 +++++++++++++++++++ 1 file changed, 25 insertions(+) diff --git a/Sprint-2/implement_linked_list/linked_list.py b/Sprint-2/implement_linked_list/linked_list.py index e69de29b..a574cdee 100644 --- a/Sprint-2/implement_linked_list/linked_list.py +++ b/Sprint-2/implement_linked_list/linked_list.py @@ -0,0 +1,25 @@ +class LinkedList: + class clsNode: + def __init__(self, value): + self.next = None + self.previous = None + self.value = value + + def __init__(self): + self.head = None + self.tail = None + self.size = 0 + + def push_head(self, value): + new_node = self.clsNode(value=value) + if self.head == None: + self.head = new_node + self.tail = new_node + else: + new_node.next = self.head + self.head.previous = new_node + self.head = new_node + self.size += 1 + return new_node + + \ No newline at end of file From d6fc4b08c37406a45ebfe6dec1dba97ee7966a90 Mon Sep 17 00:00:00 2001 From: Ahmad Hmedan Date: Fri, 2 Oct 2026 23:30:02 +0100 Subject: [PATCH 2/4] feat: implement pop_tail for linked list --- Sprint-2/implement_linked_list/linked_list.py | 15 ++++++++++++++- 1 file changed, 14 insertions(+), 1 deletion(-) diff --git a/Sprint-2/implement_linked_list/linked_list.py b/Sprint-2/implement_linked_list/linked_list.py index a574cdee..89a9580b 100644 --- a/Sprint-2/implement_linked_list/linked_list.py +++ b/Sprint-2/implement_linked_list/linked_list.py @@ -22,4 +22,17 @@ def push_head(self, value): self.size += 1 return new_node - \ No newline at end of file + def pop_tail(self): + if self.tail == None: + return + removed_value = self.tail.value + + if self.head == self.tail: + self.head = None + self.tail = None + self.size -= 1 + return removed_value + self.tail = self.tail.previous + self.tail.next = None + self.size -= 1 + return removed_value From 557171c7b04f4a67c343762fa05081536494ef5e Mon Sep 17 00:00:00 2001 From: Ahmad Hmedan Date: Fri, 2 Oct 2026 23:30:36 +0100 Subject: [PATCH 3/4] feat: implement remove node for linked list --- Sprint-2/implement_linked_list/linked_list.py | 22 +++++++++++++++++++ 1 file changed, 22 insertions(+) diff --git a/Sprint-2/implement_linked_list/linked_list.py b/Sprint-2/implement_linked_list/linked_list.py index 89a9580b..5334fc88 100644 --- a/Sprint-2/implement_linked_list/linked_list.py +++ b/Sprint-2/implement_linked_list/linked_list.py @@ -36,3 +36,25 @@ def pop_tail(self): self.tail.next = None self.size -= 1 return removed_value + + def remove(self, node): + if node == None: + return + if node == self.head and node == self.tail: + self.head = None + self.tail = None + + elif node == self.head: + self.head = self.head.next + self.head.previous = None + + elif node == self.tail: + self.tail = self.tail.previous + self.tail.next = None + + else: + node.next.previous = node.previous + node.previous.next = node.next + node.next = None + node.previous = None + self.size -= 1 From 2ecb9e818c3e90ed5dc95245b7ca18d7b21faa9d Mon Sep 17 00:00:00 2001 From: Ahmad Hmedan Date: Sun, 11 Oct 2026 10:52:11 +0100 Subject: [PATCH 4/4] refactor: simplify linked list node removal and reduce memory usage --- Sprint-2/implement_linked_list/linked_list.py | 16 ++++++---------- 1 file changed, 6 insertions(+), 10 deletions(-) diff --git a/Sprint-2/implement_linked_list/linked_list.py b/Sprint-2/implement_linked_list/linked_list.py index 5334fc88..92a32fc2 100644 --- a/Sprint-2/implement_linked_list/linked_list.py +++ b/Sprint-2/implement_linked_list/linked_list.py @@ -1,5 +1,7 @@ class LinkedList: - class clsNode: + class Node: + __slots__ = ("next","previous","value") + def __init__(self, value): self.next = None self.previous = None @@ -11,7 +13,7 @@ def __init__(self): self.size = 0 def push_head(self, value): - new_node = self.clsNode(value=value) + new_node = self.Node(value=value) if self.head == None: self.head = new_node self.tail = new_node @@ -27,15 +29,9 @@ def pop_tail(self): return removed_value = self.tail.value - if self.head == self.tail: - self.head = None - self.tail = None - self.size -= 1 - return removed_value - self.tail = self.tail.previous - self.tail.next = None - self.size -= 1 + self.remove(self.tail) return removed_value + def remove(self, node): if node == None: