Top K Frequent Elements

Problem: Top K Frequent Elements

Use a hash table to hold element frequency and sort it for answers.

Code in Python:

class Solution(object):
    def topKFrequent(self, nums, k):
        """
        :type nums: List[int]
        :type k: int
        :rtype: List[int]
        """
        m = {}
        for num in nums:
            m[num] = m[num] + 1 if num in m else 0

        m = sorted(m, key=m.get, reverse=True)
        return m[:k]