2981. Find Longest Special Substring That Occurs Thrice I

class Solution {
public:
   int maximumLength(string s) {
    map<char,int>maps;
    for( auto &a:s){
        maps[a]++;
    }
    bool test=false;
    for(auto &a:maps){
        if(a.second>1)
            test=true;

    }
    if(test==false)
        return -1;
    int res=-1;
    map<string,int>tmp;
    for(int i=0;i<s.size();i++){
        int j=i+1;
        tmp[s.substr(i,1)]++;
        while(j<s.size() && s[i]==s[j] ){
            tmp[s.substr(i,j-i+1)]++;
            j++;

        }
    }
    for(auto &a:tmp){
        if(a.second>=3){
            int i=a.first.size();
            if(i>res){
                res=a.first.size();
            }
        }
    }
    return res;
}
};