Zero To DSAZero To DSA
Privacy Policy路FAQ路Report a Bug路Support on Ko鈥慺i
Longest Consecutive Sequence

Top K Frequent Elements

medium
Time: O(n)
Space: O(n)

Given an integer array nums and an integer k, return the k most frequent elements.

Constraints

  • 1 <= nums.length <= 10^5
  • k is in the range [1, number of unique elements]

Examples

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