LeetCode #206: Reverse Linked List

Author: WazedKhan

prep/practice/linked_list.py

@@ -0,0 +1,28 @@
+from typing import Optional
+
+
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+
+def print_list(head):
+    current = head
+    while current is not None:
+        print(current.val, end=" ")
+        current = current.next
+    print()
+
+
+class Solution:
+    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
+        prev = None
+        current = head
+
+        while current:
+            next_node = current.next
+            current.next = prev
+            prev = current
+            current = next_node
+        return prev