c_cpp HR-SherlockAndTheValidString

Posted 2021-05-14

#include <bits/stdc++.h>

using namespace std;

// Complete the isValid function below.
string isValid(string s) {
    map<char,int> count;
    for(int i=0;i<s.size();i++){
        count[s[i]]++; // freq of alphabets
    }
    map<int,int> countFreq;
    for(auto i=count.begin();i!=count.end();i++){
        countFreq[i->second]++; // freq of frequencies
    }
    if(countFreq.size()==1){
        return "YES"; // all have same frequency
    }
    if(countFreq.size()>2){
        return "NO"; // not possible to delete more than 1 element
    }
    vector<pair<int,int> >a;
    for(auto i=countFreq.begin();i!=countFreq.end();i++){
        a.push_back({i->first,i->second});
    }
    if(a[0].second==1 && a[1].second==1){
        if(abs(a[0].first-a[1].first)>1){
            return "NO";
        }else{
            return "YES";
        }
    }
    if(a[1].second<a[0].second){
        pair<int,int> temp;
        temp=a[0];
        a[0]=a[1];
        a[1]=temp;
    }
    if(a[0].second>1){ // there should be only one element with diff freq
        return "NO";
    }
    if(a[0].first-a[1].first==1 || a[0].first==1){ // element to be deleted must have single difference
        //with maxfreq elements
        return "YES";
    }
    return "NO";
}

int main()
{
    ofstream fout(getenv("OUTPUT_PATH"));

    string s;
    getline(cin, s);

    string result = isValid(s);

    fout << result << "\n";

    fout.close();

    return 0;
}