From 2cec78857e1698a7d6407f1dbf2ea335c6a02e07 Mon Sep 17 00:00:00 2001 From: ImAlpha Date: Wed, 9 Aug 2023 22:50:32 -0700 Subject: [PATCH] Solved, iterate through dict K number of times and remove highest value each time beat 93% memory --- .../Arrays_and_Hashing/347_Top_K_Frequent_Elements.py | 7 ++++--- 1 file changed, 4 insertions(+), 3 deletions(-) diff --git a/NeetCodeRoadmap/Arrays_and_Hashing/347_Top_K_Frequent_Elements.py b/NeetCodeRoadmap/Arrays_and_Hashing/347_Top_K_Frequent_Elements.py index 6df7356..e129080 100644 --- a/NeetCodeRoadmap/Arrays_and_Hashing/347_Top_K_Frequent_Elements.py +++ b/NeetCodeRoadmap/Arrays_and_Hashing/347_Top_K_Frequent_Elements.py @@ -11,9 +11,10 @@ def topKFrequent(nums, k): frequency[x] = 1 else: frequency[x] += 1 - for y in frequency: - if frequency[y] >= k: - elements.append(y) + for i in range(k): + maxKey = max(frequency, key=frequency.get) + elements.append(maxKey) + del frequency[maxKey] return elements