//A string is said to be smart if all characters of the string appear the same number of times. //It is also called smart string if one can remove just character at any index in the string and the remaining characters will occur the same number of times // I am getting proper result for 3 input cases mentioed in main function // Query : //Is this solution full proof for all scenario or you are abl to find any glitches? //Is this code optimized? If not, please suggest your view #include #include #include using namespace std; bool IsSmartString(string s) { vector vecCnt(52); for (const auto& c : s) { if(islower (c)) vecCnt[c-97] +=1; //97 is for a and we will store a at zero location else if(isupper (c)) vecCnt[c-65+26] +=1; //65 is for A and we will store A at 26 location location } //sort vector sort(vecCnt.begin(),vecCnt.end()); //remove zeros auto itr = find(vecCnt.begin(),vecCnt.end(),1); vecCnt.erase(vecCnt.begin(),itr); /*for (const auto& c : vecCnt) { cout << c << endl; }*/ int intCnt = vecCnt.size(); if(intCnt ==0) return true; //all same count if (vecCnt[0]==vecCnt[intCnt-1]) { cout << "Case 1"; return true; } //first is of count 1 (which can be discarded) and rest all are of same count else if (vecCnt[0]==1 && (vecCnt[1]==vecCnt[intCnt-1])) { cout << "Case 2"; return true; } //first and last has difference of 1 (that diff can be discarded) and last as well as second last is not same else if ((vecCnt[intCnt-1] - vecCnt[0] ==1) && (vecCnt[intCnt-1]!=vecCnt[intCnt-2])) { cout << "Case 3"; return true; } return false; } int main() { bool issmart = IsSmartString("aabbcd"); //bool issmart = IsSmartString("abcdefghhgfedecba"); //bool issmart = IsSmartString("aabbc"); cout << boolalpha << issmart; return 0; }

smartString