Using Counter() in Python to find minimum character removal to make two strings anagram

# Function remove minimum number of characters so that
# two strings become anagram
from collections import Counter
def removeChars(str1, str2):

    # make dictionaries from both strings
    dict1 = Counter(str1)
    dict2 = Counter(str2)

    # extract keys from dict1 and dict2
    keys1 = dict1.keys()
    keys2 = dict2.keys()

    # count number of keys in both lists of keys
    count1 = len(keys1)
    count2 = len(keys2)

    # convert list of keys in set to find common keys
    set1 = set(keys1)
    commonKeys = len(set1.intersection(keys2))

    if (commonKeys == 0):
        return count1 + count2
    else:
        return (max(count1, count2)-commonKeys)

# Driver program
if __name__ == "__main__":
    str1 ='bcadeh'
    str2 ='hea'
    print (removeChars(str1, str2))

# Function remove minimum number of characters so that
# two strings become anagram
from collections import Counter
def removeChars(a, b):

    # make dictionaries from both strings
    c1 = Counter(a)
    c2 = Counter(b)
    
    # finding the common elements from both dictionary
    common = c1&c2
    value = 0

    # adding up the key from common dictionary in order
    # to get the total number of common elements
    for key in common:
        value = value + common[key]
        
    # returning the number of elements to be
    # removed to form an anagram
    return (len(a)-2*value+ len(b))        

# Driver program
if __name__ == "__main__":
    str1 ='bcadeh'
    str2 ='hea'
    print (removeChars(str1, str2))