string happyLadybugs(string b) {
    vector<int> occ(26, 0);
    bool happy = true, underscore = false;
    b = "0"+b+"0";
    for(int i = 1; i < b.size()-1; i++){
        if(b[i] != '_' && b[i] != b[i-1] && b[i] != b[i+1]) happy = false;
        if(b[i] == '_') underscore = true;
        else occ[b[i] - 'A']++;
    }
    if(happy) return "YES";
    if(underscore && find(occ.begin(), occ.end(), 1) == occ.end()) return "YES";
    return "NO";
}

def ishappy(b):
    for bug in range(1, len(b) - 1):
        if b[bug] == b[bug - 1] or b[bug] == b[bug + 1]:
            continue
        else:
            return False
    return True

def happyLadybugs(b):
    ladybugs = set([string for string in b if string != "_"])
    if list(b).count("_") < 1 and not ishappy(b):
        return "NO"
    for ladybug in ladybugs:
        if list(b).count(ladybug) < 2:
            return "NO"
    return "YES"

from collections import Counter

def are_happy(b):
    for i in range(len(b)):
        happy = False
        if i > 0:
            if b[i-1] == b[i]:
                happy = True
        if i < len(b) - 1:
            if b[i+1] == b[i]:
                happy = True
        if not happy:
            return False
    return True
        

def happyLadybugs(b):
    c = Counter(b)
    if c['_'] < 1:
        if are_happy(b):
            return 'YES'
        else:
            return 'NO'
    
    for key, count in c.most_common()[::-1]:
        if count == 1 and key != '_':
            return 'NO'
        if count > 1:
            return 'YES'
    return 'YES'

unordered_map<char, int> ladybug;
     int flag = 0;
     //counting frequency of character
     for(int i = 0; i< b.size(); i++){
        ladybug[b[i]]++;
     }
     
     //checking the count of the character greater than 1
     if(ladybug.size() > 1){
        for(int i = 0; i< ladybug.size(); i++){
            char c = i+ 65;
            if(ladybug[c]== 1 && c != '_') return "NO";
        }
     }
     
     //checking if any possible chance to switch 
     for(auto i : ladybug){
        if(i.first == '_'){flag = 1; break;}
     }
     
     // checking it is sorted or not if there is no chance to switch
     if(flag == 0){
        for(int i = 0; i< b.size();i++){
            if(b[i] == b[i+1] || b[i] == b[i-1]){
                flag = 1;
            }else{
                flag = 0;
                break;
            }
        }
     }
     
     return  flag == 0 ? "NO" : "YES";

		int count = 0;
		char[] chars = b.toCharArray();

		if (b.indexOf('_') >= 0)
			Arrays.sort(chars);

		for (int i = 1; i < chars.length; ++i) {
			if (chars[i] == '_')
				break;

			if (chars[i - 1] == chars[i]) {
				++count;
			} else if (count == 0) {
				count = -1;
				break;
			} else {
				count = 0;
			}

		}

		return count > 0 || chars[0] == '_' ? "YES" : "NO";