Top K Frequent Elements | Dataford Interview Questions

Top K frequent elements

Asked in the Online Assessment stage. Passed 21/21 test cases.

Task

Given an integer array nums and integer k, return the k values with the highest frequencies. Return results ordered by decreasing frequency; break frequency ties by ascending numeric value.

Input and Output

Implement top_k_frequent(nums, k). The input is a non-empty list of integers and a valid integer k. Return a list containing exactly k distinct integers.

Constraints

1 <= len(nums) <= 10^4
1 <= k <= number of distinct values
-10^4 <= nums[i] <= 10^4

Function Signature

def top_k_frequent(nums, k):

Your question is Top K Frequent Elements. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem