From 27dedf62da3a44cffc41f4e44b848b2bc8d0d4dd Mon Sep 17 00:00:00 2001
From: jla670 <jla670@sfu.ca>
Date: Fri, 17 Apr 2026 11:52:30 -0700
Subject: [PATCH 1/2] reverse linked list solution

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

diff --git a/reverse-linked-list/jylee2033.py b/reverse-linked-list/jylee2033.py
new file mode 100644
index 0000000000..358900aa36
--- /dev/null
+++ b/reverse-linked-list/jylee2033.py
@@ -0,0 +1,24 @@
+# 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: Optional[ListNode]) -> Optional[ListNode]:
+        # Handle empty list
+        if head is None:
+            return head
+
+        prev = None
+        cur = head # Start from the head node
+
+        # Traverse until the last node
+        while cur.next is not None:
+            nxt = cur.next # Store next node
+            cur.next = prev # Reverse the link
+            prev = cur # Move prev forward
+            cur = nxt # Move cur forward
+
+        # Handle the last node
+        cur.next = prev
+        return cur

From e75cdd4b5fff3a81beb5183e526810c2b3fb1347 Mon Sep 17 00:00:00 2001
From: jla670 <jla670@sfu.ca>
Date: Fri, 17 Apr 2026 11:55:44 -0700
Subject: [PATCH 2/2] add complexity

---
 reverse-linked-list/jylee2033.py | 3 +++
 1 file changed, 3 insertions(+)

diff --git a/reverse-linked-list/jylee2033.py b/reverse-linked-list/jylee2033.py
index 358900aa36..2729d6e8ac 100644
--- a/reverse-linked-list/jylee2033.py
+++ b/reverse-linked-list/jylee2033.py
@@ -22,3 +22,6 @@ def reverseList(self, head: Optional[ListNode]) -> Optional[ListNode]:
         # Handle the last node
         cur.next = prev
         return cur
+
+# Time Complexity: O(n)
+# Space Complexity: O(1)