AlgoLounge

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.

Example 1

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

Example 2

Input: nums = [1], k = 1
Output: [1]

Constraints

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

Follow-up: Your algorithm's time complexity must be better than O(n log n), where n is the array's size.

TypeScript
Loading editor…
List of test cases (5)
Case 1
nums = [1,1,1,2,2,3]
k = 2
Case 2
nums = [1]
k = 1
Case 3
nums = [4,4,4,6,6,1,1,1,1]
k = 2
Case 4
nums = [5,5,4,4,3,3,2,1]
k = 3
Case 5
nums = [1,2]
k = 2