longest consecutive sequence solution & added newline

Author: yayyz

longest-consecutive-sequence/yayyz.py

@@ -0,0 +1,22 @@
+class Solution:
+    def longestConsecutive(self, nums: List[int]) -> int:
+        if len(nums) == 0: 
+            return 0
+        
+        nums = sorted(set(nums))
+        
+        currLength = 1
+        lastNum = nums[0]
+        result = 1
+        
+        for i in range(1, len(nums)):
+            if nums[i] == lastNum + 1:
+                currLength += 1
+            else:
+                currLength = 1
+            
+            result = max(result, currLength)
+            lastNum = nums[i]
+        
+        return result 
+    

product-of-array-except-self/yayyz.py

@@ -13,4 +13,5 @@ def productExceptSelf(self, nums: List[int]) -> List[int]:
             output[i] *= postfix
             postfix *= nums[i]
 
-        return output
+        return output
+