Updated markdown files

Author: Zanger67/leetcode

markdowns/Questions_By_Code_Length.md

@@ -214,6 +214,7 @@ Calculations are based on the code files's byte sizes.
 | 1184 | [Distance Between Bus Stops](<https://leetcode.com/problems/distance-between-bus-stops>)                                                                                                   | Easy    |                           | [solution](<_1184. Distance Between Bus Stops.md>)                                                  | py                                          | May 31, 2024    |
 |  362 | [Design Hit Counter](<https://leetcode.com/problems/design-hit-counter>)                                                                                                                   | Medium  |                           | [solution](<_362. Design Hit Counter.md>)                                                           | py                                          | Oct 24, 2024    |
 |   90 | [Subsets II](<https://leetcode.com/problems/subsets-ii>)                                                                                                                                   | Medium  | N150                      | [solution](<_90. Subsets II.md>)                                                                    | py                                          | Jul 03, 2024    |
+|  128 | [Longest Consecutive Sequence](<https://leetcode.com/problems/longest-consecutive-sequence>)                                                                                               | Medium  | B75, N150                 | [solution](<_128. Longest Consecutive Sequence.md>)                                                 | java, py                                    | Jun 13, 2024    |
 | 1730 | [Shortest Path to Get Food](<https://leetcode.com/problems/shortest-path-to-get-food>)                                                                                                     | Medium  | Weekly Premium            | [solution](<_1730. Shortest Path to Get Food.md>)                                                   | py                                          | Jun 26, 2024    |
 | 1530 | [Number of Good Leaf Nodes Pairs](<https://leetcode.com/problems/number-of-good-leaf-nodes-pairs>)                                                                                         | Medium  | Daily                     | [solution](<_1530. Number of Good Leaf Nodes Pairs.md>)                                             | py                                          | Jul 18, 2024    |
 | 1823 | [Find the Winner of the Circular Game](<https://leetcode.com/problems/find-the-winner-of-the-circular-game>)                                                                               | Medium  | Daily                     | [solution](<_1823. Find the Winner of the Circular Game.md>)                                        | c, cpp, java, js, py                        | Jul 08, 2024    |
@@ -226,7 +227,6 @@ Calculations are based on the code files's byte sizes.
 |  946 | [Validate Stack Sequences](<https://leetcode.com/problems/validate-stack-sequences>)                                                                                                       | Medium  |                           | [solution](<_946. Validate Stack Sequences.md>)                                                     | c, py                                       | Jun 12, 2024    |
 |  211 | [Design Add and Search Words Data Structure](<https://leetcode.com/problems/design-add-and-search-words-data-structure>)                                                                   | Medium  | B75, N150                 | [solution](<_211. Design Add and Search Words Data Structure.md>)                                   | py                                          | Jun 27, 2024    |
 | 1020 | [Number of Enclaves](<https://leetcode.com/problems/number-of-enclaves>)                                                                                                                   | Medium  |                           | [solution](<_1020. Number of Enclaves.md>)                                                          | py                                          | Jun 26, 2024    |
-|  128 | [Longest Consecutive Sequence](<https://leetcode.com/problems/longest-consecutive-sequence>)                                                                                               | Medium  | B75, N150                 | [solution](<_128. Longest Consecutive Sequence.md>)                                                 | java, py                                    | Jun 13, 2024    |
 |  141 | [Linked List Cycle](<https://leetcode.com/problems/linked-list-cycle>)                                                                                                                     | Easy    | B75, N150                 | [solution](<_141. Linked List Cycle.md>)                                                            | c, py                                       | Jun 04, 2024    |
 |   61 | [Rotate List](<https://leetcode.com/problems/rotate-list>)                                                                                                                                 | Medium  |                           | [solution](<_61. Rotate List.md>)                                                                   | py                                          | Jun 22, 2024    |
 | 2852 | [Sum of Remoteness of All Cells](<https://leetcode.com/problems/sum-of-remoteness-of-all-cells>)                                                                                           | Medium  | Weekly Premium            | [solution](<_2852. Sum of Remoteness of All Cells.md>)                                              | py                                          | Jan 23, 2025    |

markdowns/_128. Longest Consecutive Sequence.md

@@ -8,7 +8,7 @@
 
 > *First completed : June 13, 2024*
 >
-> *Last updated : July 01, 2024*
+> *Last updated : March 12, 2025*
 
 ------
 
@@ -57,25 +57,27 @@ class Solution {
 ### Python
 #### [m128.py](<../my-submissions/m128.py>)
 ```Python
-# O(n) solution babyyyy
-
 class Solution:
     def longestConsecutive(self, nums: List[int]) -> int:
         if len(nums) == 0 :
             return 0
-        
+
         vals = set(nums)                # O(n) creation, O(1) lookups
 
         maxx = 0
-        for val in vals:                # O(n) looping
-            if val - 1 in vals:         # not start of sequence
-                continue
-            
-            cnter = 1
-            while val + cnter in vals :
-                cnter += 1
-
-            maxx = max(maxx, cnter)
+        while vals :
+            left = right = vals.pop()
+            curr = 1
+            while left - 1 in vals :
+                left -= 1
+                curr += 1
+                vals.remove(left)
+            while right + 1 in vals :
+                right += 1
+                curr += 1
+                vals.remove(right)
+
+            maxx = max(maxx, curr)
 
         return maxx