r-rahul1
diff --git a/‎347-top-k-frequent-elements/347-top-k-frequent-elements.py
Copy file name to clipboard
+11Lines changed: 11 additions & 0 deletions b/‎347-top-k-frequent-elements/347-top-k-frequent-elements.py
Copy file name to clipboard
+11Lines changed: 11 additions & 0 deletions
@@ -0,0 +1,11 @@
+import heapq
+from collections import Counter
+class Solution:
+    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
+        res = []
+        dic = Counter(nums)
+        max_heap = [(-val, key) for key, val in dic.items()]
+        heapq.heapify(max_heap)
+        for i in range(k):
+            res.append(heapq.heappop(max_heap)[1])
+        return res