Add documentation and updates to 128

Author: Zanger67

my-submissions/m128 v1.py

@@ -0,0 +1,21 @@
+# 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)
+
+        return maxx

my-submissions/m128 v2.py

@@ -0,0 +1,19 @@
+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)
+
+        return maxx

my-submissions/m128.md

@@ -0,0 +1,11 @@
+## m128 v1
+
+My initial attempt that was successful but inefficient. Achieved around a 350ms runtime.
+
+## m128 java
+
+Second attempt that was much more successful and achieved a reasonable runtim
+
+## m128 v2
+
+2nd python attempt that implemented a set removal optimization to save redundancy that brought the python version to the same runtime level as java.