Back

Top K Frequent Elements

medium

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

Test Cases

Copy an input into the main harness and Run to verify
Input
nums = [1,1,1,2,2,3], k = 2
Expected Output
[1,2]
Input
nums = [1], k = 1
Expected Output
[1]

Constraints

  • 1 <= nums.length <= 10^5
  • -10^4 <= nums[i] <= 10^4
  • k is in the range [1, the number of unique elements in the array].
  • It is guaranteed that the answer is unique.

Hints

Hint 1 — click to reveal

Count frequencies with a hash map first.

Hint 2 — click to reveal

Then a min-heap of size k ordered by frequency keeps the top k.

Java Compiler

Powered by OneCompiler. Starter code loads automatically — edit and hit Run.