replaced ListNode for ListNode utils

Author: i-redbyte

Diff for: easy/convert binary number in a linked list to integer/solution.py

@@ -1,8 +1,4 @@
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: easy/delete node in a linked list/solution.py

@@ -1,8 +1,5 @@
-# Definition for singly-linked list.
-# class ListNode:
-#     def __init__(self, x):
-#         self.val = x
-#         self.next = None
+from utils import ListNode
+
 
 class Solution:
     def deleteNode(self, node):
@@ -12,4 +9,3 @@ def deleteNode(self, node):
         """
         node.val = node.next.val
         node.next = node.next.next
-

Diff for: easy/intersection of two linked lists/solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, x):
-        self.val = x
-        self.next = None
+from utils import ListNode
 
 
 class Solution:

Diff for: easy/linked list cycle/solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, x):
-        self.val = x
-        self.next = None
+from utils import ListNode
 
 
 class Solution:

Diff for: easy/merge two sorted lists/solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: easy/palindrome linked list/solution.py

@@ -1,11 +1,4 @@
-from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: easy/remove duplicates from sorted list/solution.py

@@ -1,11 +1,5 @@
-# Definition for singly-linked list.
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: easy/remove linked list elements/solution.py

@@ -1,13 +1,7 @@
-# Definition for singly-linked list.
+from utils import ListNode
 from typing import Optional
 
 
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
-
-
 class Solution:
     def removeElements(self, head: Optional[ListNode], val: int) -> Optional[ListNode]:
         prev, current = None, head

Diff for: easy/reverse linked list/solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: hard/merge k sorted lists/solution.py

@@ -1,10 +1,5 @@
 from typing import List, Optional
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: hard/reverse nodes in k-group/solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/add two numbers/solution.py

@@ -1,8 +1,4 @@
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/insertion sort list/solution.py

@@ -1,11 +1,5 @@
-# Definition for singly-linked list.
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/maximum twin sum of a linked list /solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/odd even linked list/solution.py

@@ -1,13 +1,7 @@
-# Definition for singly-linked list.
+from utils import ListNode
 from typing import Optional
 
 
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
-
-
 class Solution:
     def oddEvenList(self, head: Optional[ListNode]) -> Optional[ListNode]:
         if not head or not head.next:

Diff for: medium/remove nth node from end of list/solution.py

@@ -1,11 +1,5 @@
-# Definition for singly-linked list.
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/reorder list/solution.py

@@ -1,11 +1,5 @@
-# Definition for singly-linked list.
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/reverse linked list II/solution.py

@@ -1,10 +1,5 @@
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/rotate list/solution.py

@@ -1,8 +1,4 @@
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/swap nodes in pairs/solution.py

@@ -1,11 +1,5 @@
-# Definition for singly-linked list.
 from typing import Optional
-
-
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: medium/swapping nodes in a linked list/solution.py

@@ -1,11 +1,5 @@
 from typing import Optional
-
-
-# Definition for singly-linked list.
-class ListNode:
-    def __init__(self, val=0, next=None):
-        self.val = val
-        self.next = next
+from utils import ListNode
 
 
 class Solution:

Diff for: utils.py

@@ -13,7 +13,7 @@ def print_tree(self):
         if self.right:
             self.right.print_tree()
 
-
+# Definition for singly-linked list.
 class ListNode:
     def __init__(self, val=0, next=None):
         self.val = val