Merge pull request #1 from swapnil290502/swapnil290502-patch-1

Create Efficient solution for Longest Consecutive sequence leetcode p…

Author: swapnil290502

Diff for: Efficient solution for Longest Consecutive sequence leetcode problem

@@ -0,0 +1,14 @@
+def longestConsecutive(nums):
+    nums = set(nums)
+    best = 0
+    for x in nums:
+        if x - 1 not in nums:
+            y = x + 1
+            while y in nums:
+                y += 1
+            best = max(best, y - x)
+    return best
+
+nums = [0,3,7,2,5,8,4,6,0,1]
+result = longestConsecutive(nums)
+print(result)