clears 33/73 cases

NeetCodeRoadmap/Arrays_and_Hashing/128_Longest_Consecutive_Sequence.py

@@ -10,9 +10,12 @@ def longestConsecutive(nums):
         for x in nums:
             if x < length and x not in sequence:
                 sequence.append(x)
+            elif x == max(sequence)+1:
+                sequence.append(x)
             else:
                 larger.append(x)
         return len(sequence)
 
 print(longestConsecutive([100,4,200,1,3,2]))
-print(longestConsecutive([0,3,7,2,5,8,4,6,0,1]))
+print(longestConsecutive([0,3,7,2,5,8,4,6,0,1]))
+print(longestConsecutive([1,3,5,2,4]))