reafactor(data structure, linked list): add negative values validation

Author: BrianLusina

datastructures/linked_lists/singly_linked_list/single_linked_list.py

@@ -394,6 +394,9 @@ def reverse_between(self, left: int, right: int) -> Optional[SingleNode]:
         if left > right:
             raise ValueError(f"left {left} cannot be greater than right {right}")
 
+        if left < 1 or right < 1:
+            raise ValueError("left and right must be positive integers")
+
         if self.head is None or self.head.next is None:
             return self.head
 
@@ -402,6 +405,9 @@ def reverse_between(self, left: int, right: int) -> Optional[SingleNode]:
                 f"right {right} cannot be greater than the length of the linked list {len(self)}"
             )
 
+        if left == right:
+            return self.head
+
         # Move the 2 pointers until they reach the proper starting point in the list
         current_pointer, previous_pointer = self.head, None
 
@@ -463,6 +469,9 @@ def reverse_between_with_dummy(self, left: int, right: int) -> Optional[SingleNo
         if left > right:
             raise ValueError(f"left {left} cannot be greater than right {right}")
 
+        if left < 1 or right < 1:
+            raise ValueError("left and right must be positive integers")
+
         if self.head is None or self.head.next is None:
             return self.head
 
@@ -492,10 +501,9 @@ def reverse_between_with_dummy(self, left: int, right: int) -> Optional[SingleNo
         return dummy.next
 
     def unshift(self, node_: SingleNode) -> SingleNode:
-        if self.head:
-            return node_
         node_.next = self.head
-        return node_
+        self.head = node_
+        return self.head
 
     def insert(self, node_, pos):
         counter = 1

datastructures/trees/trie/suffix/types.py

@@ -1,6 +1,8 @@
 from typing import Tuple
+import sys
+
 
 # Type alias for the best word info: (length, original_index)
 WordInfo = Tuple[int, int]
 # Initialize with a very large length to ensure the first word always wins
-INF_WORD_INFO: WordInfo = (float("inf"), float("inf"))
+INF_WORD_INFO: WordInfo = (sys.maxsize, sys.maxsize)