Top k most frequent number in a stream

#1

i have submitted the code can you please check whats the problem in this

#2

@Chitwan Bro, have you even looked at input format or just lifted code from somewhere else and submitted. Clearly all your inputs are hard coded.

Here I have corrected your submission, mark the doubt resolved and rate full!

import java.util.*;
public class Main {
static int find(int[] arr, int ele)
{
for (int i = 0; i < arr.length; i++)
if (arr[i] == ele)
return i;
return -1;
}

static void kTop(int[] a, int n, int k) 
{ 
	int[] top = new int[k + 1];  
	HashMap<Integer, Integer> freq = new HashMap<>(); 
	for (int i = 0; i < k + 1; i++) 
		freq.put(i, 0); 

	for (int m = 0; m < n; m++) { 
		 
		if (freq.containsKey(a[m])) 
			freq.put(a[m], freq.get(a[m]) + 1); 
		else
			freq.put(a[m], 1); 

		
		top[k] = a[m]; 

		 
		int i = find(top, a[m]); 
		i -= 1; 

		
		while (i >= 0) { 
		
			if (freq.get(top[i]) < freq.get(top[i + 1])) { 
				int temp = top[i]; 
				top[i] = top[i + 1]; 
				top[i + 1] = temp; 
			} 

			else if ((freq.get(top[i]) == freq.get(top[i + 1])) && (top[i] > top[i + 1])) { 
				int temp = top[i]; 
				top[i] = top[i + 1]; 
				top[i + 1] = temp; 
			} 

			else
				break; 
			i -= 1; 
		} 

		for (int j = 0; j < k && top[j] != 0; ++j) 
			System.out.print(top[j] + " "); 
	} 
	System.out.println(); 
} 

public static void main(String args[]) 
{ 
	Scanner sc = new Scanner(System.in);
	int t = sc.nextInt();

	while(t-- != 0) {
	int n = sc.nextInt(); 
	int k = sc.nextInt();
	int[] arr = new int[n]; 
	for(int l=0;l<n;l++)
	{
		arr[l] = sc.nextInt();
	}
	kTop(arr, n, k); 
	}
}

}