def makeAnagram(a, b):
    # Write your code here
    a_counts = Counter(a)
    b_counts = Counter(b)
    char_set = set(a + b)
    deletions = 0
    for char in char_set:
        deletions += abs(a_counts.get(char, 0) - b_counts.get(char, 0))
    return deletions
    

def makeAnagram(a, b):
    remove_count = 0
    a_set = set(a)
    b_set = set(b)
    a_count_map = {el: a.count(el) for el in a_set}
    b_count_map = {el: b.count(el) for el in b_set}
    
    for el in a_set:
        if a_count_map.get(el, 0) > b_count_map.get(el, 0):
           remove_count += a_count_map.get(el, 0) - b_count_map.get(el, 0) 

    for el in b_set:
        if b_count_map.get(el, 0) > a_count_map.get(el, 0):
           remove_count += b_count_map.get(el, 0) - a_count_map.get(el, 0) 
    
    return remove_count

int makeAnagram(string a, string b) {
    string anagram;
    
    for (int i = 0; i < a.length(); i++) {
        int bCharCount = (int)count(b.begin(), b.end(), a.at(i));
        int anagramCount = (int)count(anagram.begin(), anagram.end(), a.at(i));
        
        
        if ((b.find(a[i]) != string::npos)) {
            if (anagramCount < bCharCount)
                anagram += a[i];
        } 
    }
    
    return (a.length() + b.length()) - (anagram.length() * 2);
}