Update Longest Consecutive Sequence - Leetcode 128.py

Author: rai-abhi24

Longest Consecutive Sequence - Leetcode 128.py

@@ -2,6 +2,7 @@ class Solution:
     def longestConsecutive(self, nums: List[int]) -> int:
         s = set(nums)
         longest = 0
+
         for num in nums:
             if num - 1 not in s:
                 next_num = num + 1
@@ -11,4 +12,7 @@ def longestConsecutive(self, nums: List[int]) -> int:
                     next_num += 1
                 longest = max(longest, length)
 
-        return longest
+        return longest
+
+# Time Complexity: O(n)
+# Space Complexity: O(n)