Geeksforgeeks Solution For " Maximum repeating number "

GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of  School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers 

Problem :- Maximum repeating number

Submit Your Solution :- Click Here 

Solution :- 

#include <bits/stdc++.h>
using namespace std;

int main() {
int t;
cin>>t;
while(t--){
   int n, k;
   cin>>n>>k;
   int a[n], b[n]={};
   for(int i=0; i<n; i++){
       cin>>a[i];
       b[a[i]]=b[a[i]]+1;
   }
   int index=0,max_v=b[0];
           
            for(int i=0;i<k;i++)
                if(b[i]>max_v){
                    max_v=b[i];
                    index=i;
                }
            cout<<index<<endl;
}
return 0;
}

Output:-