Update Top K Frequent Elements - Leetcode 347.py

Author: gahogg

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

@@ -16,6 +16,22 @@ def topKFrequent(self, nums: List[int], k: int) -> List[int]:
     # Time: O(n log k), Space: O(k)
 
 
+import heapq
+from collections import Counter
+
+def top_k_frequent(nums, k):
+    # Step 1: Count frequency
+    freq_map = Counter(nums)
+
+    # Step 2: Use max heap (invert frequency to simulate max heap)
+    max_heap = [(-freq, num) for num, freq in freq_map.items()]
+    heapq.heapify(max_heap)  # Convert list into a heap in O(n)
+
+    # Step 3: Extract k most frequent elements
+    result = [heapq.heappop(max_heap)[1] for _ in range(k)]
+    return result
+    # Max Heap
+
 # Buckets
 from collections import Counter
 class Solution: