347. Top K Frequent Elements - LeetCode Solution


Array Hash table Counting Heap Sorting

Python Code:

class Solution:
    def topKFrequent(self, nums: List[int], k: int) -> List[int]:
        arr = []
        dict1 = {}
        
        for num in nums:
            if num in dict1:
                dict1[num] +=1
                
            else:
                dict1[num] = 1
        for i in dict1:
            arr.append([dict1[i], i])
        
        arr.sort(reverse  = True)
        ans = []
        for i in range(k):
            ans.append(arr[i][1])
        return ans


Comments

Submit
0 Comments
More Questions

831B - Keyboard Layouts
814A - An abandoned sentiment from past
268C - Beautiful Sets of Points
1391C - Cyclic Permutations
11A - Increasing Sequence
1406A - Subset Mex
1365F - Swaps Again
50B - Choosing Symbol Pairs
1719A - Chip Game
454B - Little Pony and Sort by Shift
1152A - Neko Finds Grapes
1719B - Mathematical Circus
1719C - Fighting Tournament
1642A - Hard Way
285C - Building Permutation
1719E - Fibonacci Strings
1696C - Fishingprince Plays With Array
1085A - Right-Left Cipher
1508B - Almost Sorted
1690C - Restoring the Duration of Tasks
1055A - Metro
1036D - Vasya and Arrays
1139C - Edgy Trees
37A - Towers
353A - Domino
409H - A + B Strikes Back
1262A - Math Problem
158C - Cd and pwd commands
194A - Exams
1673B - A Perfectly Balanced String