leet code exercises

Blooverh · Blooverh · commit 6041a7da4d48 · 2023-07-24T22:44:59.000-05:00
diff --git a/LeetCode/ArraysAndHashing/LongestConsecutiveSeq.py b/LeetCode/ArraysAndHashing/LongestConsecutiveSeq.py
@@ -28,9 +28,9 @@ def longestConsecutive(self, nums: List[int]) -> int:
                 counter +=1
             elif sortedNums[i] - sortedNums[i-1] <= 0:
                 counter = counter
-            else:
+            elif sortedNums[i] - sortedNums[i-1] > 1:
                 counters.append(counter)
-                counter=0
+                counter=1
 
         
         counters.append(counter)
diff --git a/LeetCode/LinkedList/ReverseLinkedList.py b/LeetCode/LinkedList/ReverseLinkedList.py
@@ -0,0 +1,28 @@
+"""Given the head of a singly linked list, reverse the list, and return the reversed list."""
+
+from typing import Optional
+
+# 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]:
+        
+        current = head # intialize current pointer as head 
+        prev = None #initialize prev pointer as Null 
+
+        while current: #loop till current points to null
+            next= current.next #initialize next pointer as the next pointer of curr
+            current.next = prev #assign prev pointer to curr's next pointer
+            # assign current to prev and next to current
+            prev = current 
+            current = next
+
+        return prev #return prev poiter to get reverse of the list
+
+
+            
+            
