top k frequent elements solution"

Author: devyejin

top-k-frequent-elements/devyejin.py

@@ -0,0 +1,7 @@
+from collections import Counter
+
+
+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,6 +12,3 @@ def twoSum(self, nums, target):
                 left += 1
             else:
                 right -= 1
-
-
-