Top K Frequent Elements — Medium Coding Interview Question

Given an integer array nums and an integer k, return the k most frequent elements. You may return the answer in any order. It is guaranteed that the answer is unique.

Example

Input: nums = [1,1,1,2,2,3], k = 2

Output: [1,2]

Constraints

• 1 ≤ nums.length ≤ 10⁵
• -10⁴ ≤ nums[i] ≤ 10⁴
• k is in the range [1, number of distinct elements in nums]

Topics & Companies

Topics: arrays, hash-map, heap, sorting

Asked by: Amazon, Google, Meta, Microsoft, Yahoo

Optimal Solution Complexity

Time complexity: O(n). Space complexity: O(n).

Practice more

• All DSA Problems
• DSA Patterns