URI Online Judge | 1255 Letter Frequency solution in cpp

 uri 1255 solution in cpp 

by ujjal roy

#include<bits/stdc++.h>

using namespace std;
main()
{

    int n;
    cin>>n;
    while(n--)
    {
        string s,s2;
        char c;

       cin>>c;
       getline(cin,s2);
       s2=c+s2;
     map<char,int> m;
     int maxe=0,i;
       for(i=0;i<s2.size();i++)
       {
           char c=tolower(s2[i]);
           s+=c;
           if(s[i]>='a'&&s[i]<='z')
           {
               m[s[i]]++;
               if(m[s[i]]>=maxe) maxe=m[s[i]];
           }

       }
       sort(s.begin(),s.end());
       int l=unique(s.begin(),s.end())-s.begin();
       string s1;
       for(i=0;i<l;i++)
       {
          if(m[s[i]]==maxe) s1+=s[i];

       }
       cout<<s1<<endl;
    }





    return 0;
}