Updated markdown files

Author: Zanger67/leetcode

Diff for: markdowns/Questions_By_Code_Length.md

@@ -104,6 +104,7 @@ Calculations are based on the code files's byte sizes.
 |    2 | [Add Two Numbers](<https://leetcode.com/problems/add-two-numbers>)                                                                                                                         | Medium  | N150                      | [solution](<_2. Add Two Numbers.md>)                                                                | java                                        | May 22, 2024    |
 |  430 | [Flatten a Multilevel Doubly Linked List](<https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list>)                                                                         | Medium  |                           | [solution](<_430. Flatten a Multilevel Doubly Linked List.md>)                                      | cpp, java                                   | Jun 27, 2024    |
 |  239 | [Sliding Window Maximum](<https://leetcode.com/problems/sliding-window-maximum>)                                                                                                           | Hard    | N150                      | [solution](<_239. Sliding Window Maximum.md>)                                                       | py                                          | Jun 04, 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    |
 |  103 | [Binary Tree Zigzag Level Order Traversal](<https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal>)                                                                       | Medium  |                           | [solution](<_103. Binary Tree Zigzag Level Order Traversal.md>)                                     | py                                          | Jul 03, 2024    |
 | 3306 | [Count of Substrings Containing Every Vowel and K Consonants II](<https://leetcode.com/problems/count-of-substrings-containing-every-vowel-and-k-consonants-ii>)                           | Medium  | Daily                     | [solution](<_3306. Count of Substrings Containing Every Vowel and K Consonants II.md>)              | py                                          | Mar 10, 2025    |
 |  645 | [Set Mismatch](<https://leetcode.com/problems/set-mismatch>)                                                                                                                               | Easy    |                           | [solution](<_645. Set Mismatch.md>)                                                                 | java, py                                    | Jun 01, 2024    |
@@ -117,7 +118,6 @@ Calculations are based on the code files's byte sizes.
 |   40 | [Combination Sum II](<https://leetcode.com/problems/combination-sum-ii>)                                                                                                                   | Medium  | Daily, N150               | [solution](<_40. Combination Sum II.md>)                                                            | py                                          | Aug 13, 2024    |
 |  611 | [Valid Triangle Number](<https://leetcode.com/problems/valid-triangle-number>)                                                                                                             | Medium  |                           | [solution](<_611. Valid Triangle Number.md>)                                                        | py                                          | May 22, 2024    |
 | 3229 | Weekly Contest 407 - q4 - [Minimum Operations to Make Array Equal to Target](<https://leetcode.com/problems/minimum-operations-to-make-array-equal-to-target>)                             | Hard    | Contest                   | [solution](<_3229. Minimum Operations to Make Array Equal to Target.md>)                            | py                                          | Jul 21, 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    |
 |  381 | [Insert Delete GetRandom O(1) - Duplicates allowed](<https://leetcode.com/problems/insert-delete-getrandom-o1-duplicates-allowed>)                                                         | Hard    |                           | [solution](<_381. Insert Delete GetRandom O(1) - Duplicates allowed.md>)                            | java                                        | Jul 06, 2024    |
 |  419 | [Battleships in a Board](<https://leetcode.com/problems/battleships-in-a-board>)                                                                                                           | Medium  |                           | [solution](<_419. Battleships in a Board.md>)                                                       | c, py                                       | Jun 24, 2024    |
 |  353 | [Design Snake Game](<https://leetcode.com/problems/design-snake-game>)                                                                                                                     | Medium  |                           | [solution](<_353. Design Snake Game.md>)                                                            | py                                          | Jun 28, 2024    |

Diff for: markdowns/_128. Longest Consecutive Sequence.md

@@ -67,23 +67,29 @@ class Solution:
 
 #### [m128 v2.py](<../my-submissions/m128 v2.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