From 4d7f89a27dc067d81ae7298716cb4f57423b004f Mon Sep 17 00:00:00 2001
From: doh6077 <kimdohee@sheridancollege.ca>
Date: Mon, 22 Dec 2025 08:47:53 -0500
Subject: [PATCH] 206. Reverse Linked List Solution

---
 reverse-linked-list/doh6077.py | 19 +++++++++++++++++++
 1 file changed, 19 insertions(+)
 create mode 100644 reverse-linked-list/doh6077.py

diff --git a/reverse-linked-list/doh6077.py b/reverse-linked-list/doh6077.py
new file mode 100644
index 0000000000..569e995de2
--- /dev/null
+++ b/reverse-linked-list/doh6077.py
@@ -0,0 +1,19 @@
+# Definition for singly-linked list.
+# class ListNode:
+#     def __init__(self, val=0, next=None):
+#         self.val = val
+#         self.next = next
+# 206. Reverse Linked List
+# 1. Use two pointers 
+# 2. one pointer indicates the current node and another pointer indicate the previous node 
+class Solution:
+    def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
+        curr = head
+        prev = None
+
+        while curr is not None:
+            nextNode = curr.next
+            curr.next = prev
+            prev = curr 
+            curr = nextNode 
+        return prev