From d4bd234912fa274bb16a067c001696f1928019c0 Mon Sep 17 00:00:00 2001
From: DEV TYAGI <92231400+devtyagi3909@users.noreply.github.com>
Date: Tue, 28 Oct 2025 19:33:28 +0530
Subject: [PATCH] Implement reverse linked list function

---
 linkedlist.py | 25 +++++++++++++++++++++++++
 1 file changed, 25 insertions(+)
 create mode 100644 linkedlist.py

diff --git a/linkedlist.py b/linkedlist.py
new file mode 100644
index 000000000..49e49720e
--- /dev/null
+++ b/linkedlist.py
@@ -0,0 +1,25 @@
+# Definition for singly-linked list.
+class ListNode:
+    def __init__(self, val=0, next=None):
+        self.val = val
+        self.next = next
+
+class Solution:
+    def reverseList(self, head: [ListNode]) -> [ListNode]:
+        
+        prev = None
+        curr = head
+        
+        while curr:
+            # Store the next node
+            next_temp = curr.next
+            
+            # Reverse the current node's pointer
+            curr.next = prev
+            
+            # Move pointers one position ahead
+            prev = curr
+            curr = next_temp
+            
+        # 'prev' is the new head
+        return prev