# 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

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:-

Previous Post
Next Post

#### post written by: Ghanendra Yadav

Hi, I’m Ghanendra Yadav, SEO Expert, Professional Blogger, Programmer, and UI Developer. Get a Solution of More Than 500+ Programming Problems, and Practice All Programs in C, C++, and Java Languages. Get a Competitive Website Solution also Ie. Hackerrank Solutions and Geeksforgeeks Solutions. If You Are Interested to Learn a C Programming Language and You Don't Have Experience in Any Programming, You Should Start with a C Programming Language, Read: List of Format Specifiers in C.