day_1 continuation

rubix-coder · rubix-coder · commit 01566bc269d5 · 2024-11-18T18:26:57.000+05:30
diff --git a/leetcode-master/arrays_and_hashing/top_k_elements.py b/leetcode-master/arrays_and_hashing/top_k_elements.py
@@ -3,8 +3,6 @@
 
 Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order.
 
-
-
 Example 1:
 
 Input: nums = [1,1,1,2,2,3], k = 2
@@ -27,7 +25,18 @@
 """
 
 from typing import List
-
+from collections import Counter
+
+#solution by rubix-coder
+class SolutiontopKFrequent:
+    def topKFrequent(nums: List[int], k: int) -> List[int]:
+        most_frequent = Counter(nums)
+        return list(most_frequent.keys())[:k]
+
+nums = [1,1,1,2,2,3]
+k = 2
+result = SolutiontopKFrequent.topKFrequent(nums=nums,k=k)
+print(result)
 
 class Solution:
     def topKFrequent(self, nums: List[int], k: int) -> List[int]:
