From 39ee250c6170f213ee4eb269e315a76f7ade7d46 Mon Sep 17 00:00:00 2001
From: Tony <87371627+TonyKim9401@users.noreply.github.com>
Date: Mon, 22 Dec 2025 09:07:00 -0500
Subject: [PATCH] Revert "[doh6077] WEEK 07 solutions"

---
 reverse-linked-list/doh6077.py | 19 -------------------
 1 file changed, 19 deletions(-)
 delete mode 100644 reverse-linked-list/doh6077.py

diff --git a/reverse-linked-list/doh6077.py b/reverse-linked-list/doh6077.py
deleted file mode 100644
index 569e995de..000000000
--- a/reverse-linked-list/doh6077.py
+++ /dev/null
@@ -1,19 +0,0 @@
-# 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