longest consecutive sequence solution

Author: devyejin

longest-consecutive-sequence/devyejin.py

@@ -0,0 +1,19 @@
+class Solution(object):
+    def longestConsecutive(self, nums):
+
+        if not nums:
+            return 0
+
+        num_set = set(nums)
+        max_length = 0
+
+        for num in num_set:
+            if num - 1 not in num_set:
+                length = 1
+                while num + length in num_set:
+                    length += 1
+                max_length = max(max_length, length)
+
+        return max_length
+
+

top-k-frequent-elements/devyejin.py

@@ -1,7 +1,9 @@
 from collections import Counter
+import heapq
 
 
 class Solution(object):
     def topKFrequent(self, nums, k):
         counter = sorted(Counter(nums).items(), key=lambda item: -item[1])
         return list(num for num, count in counter[:k])
+

two-sum/devyejin.py

@@ -12,3 +12,4 @@ def twoSum(self, nums, target):
                 left += 1
             else:
                 right -= 1
+