Update Top K Frequent Elements - Leetcode 347.py

Author: gahogg

Top K Frequent Elements - Leetcode 347/Top K Frequent Elements - Leetcode 347.py

@@ -1,3 +1,20 @@
+# Heap Solution:
+from collections import Counter
+import heapq
+class Solution:
+    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
+        counter = Counter(nums)
+        heap = []
+
+        for key, val in counter.items():
+            if len(heap) < k:
+                heapq.heappush(heap, (val, key))
+            else:
+                heapq.heappushpop(heap, (val, key))
+        
+        return [h[1] for h in heap]
+    # Time: O(n log k), Space: O(k)
+
 from collections import Counter
 class Solution:
     def topKFrequent(self, nums: List[int], k: int) -> List[int]: