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

Lift queries
Goki and his breakup
Ali and Helping innocent people
Book of Potion making
Duration
Birthday Party
e-maze-in
Bricks Game
Char Sum
Two Strings
Anagrams
Prime Number
Lexical Sorting Reloaded
1514A - Perfectly Imperfect Array
580A- Kefa and First Steps
1472B- Fair Division
996A - Hit the Lottery
MSNSADM1 Football
MATCHES Playing with Matches
HRDSEQ Hard Sequence
DRCHEF Doctor Chef
559. Maximum Depth of N-ary Tree
821. Shortest Distance to a Character
1441. Build an Array With Stack Operations
1356. Sort Integers by The Number of 1 Bits
922. Sort Array By Parity II
344. Reverse String
1047. Remove All Adjacent Duplicates In String
977. Squares of a Sorted Array
852. Peak Index in a Mountain Array