Find Top K Frequent Numbers in a Stream

Given an integer array ARR and an integer K, your task is to find the K most frequent elements in ARR. Return the elements sorted in ascending order.

Example:

Input:

ARR = [1, 2, 2, 3, 3], K = 2

Output:

[2, 3]

Explanation:

2 and 3 are the elements occurring the most number of times.

Constraints:

1

Question

Find Top K Frequent Numbers in a Stream

Given an integer array ARR and an integer K, your task is to find the K most frequent elements in ARR. Return the elements sorted in ascending order.

Example:

Input:

ARR = [1, 2, 2, 3, 3], K = 2

Output:

[2, 3]

Explanation:

2 and 3 are the elements occurring the most number of times.

Constraints:

1 <= T <= 10
1 <= N <= 5000
1 <= K <= Number of unique elements in ARR
1 <= ARR[i] <= 10⁶
Time Limit: 1 sec

Accepted Answer

Find the K most frequent elements in an integer array and return them sorted in ascending order.

Use a hashmap to store the frequency of each element in the array.
Use a min heap to keep track of the K most frequent elements.
Return the elements from the min heap in ascending order.