a simple Python solution

def makingAnagrams(s1, s2):
    #common letters
    cl = set(s1) & set(s2)
    #reusable letters
    rl = 0
    for l in cl:
        rl += min(s1.count(l), s2.count(l))
    return len(s1) + len(s2)-rl * 2

My python solution: Time: O(n) Space: O(n)

def makingAnagrams(s1, s2):
    freq = [0]*26
    min_del = 0
    for c in s1:
        freq[ord(c)-ord('a')] += 1
    for c in s2:
        freq[ord(c)-ord('a')] -= 1
    for val in freq:
        min_del += abs(val)
    return min_del

A sheep could call a grandparent “GranmAA!”

Or, a person could shout at a seller of used cloth, or maybe an old-tyme hobo, “A ragman!”; technically, that's two words.

I suppose one can make another word using all the letters in “anagram.” Creativity and a willful suspension of the rules of grammar are definitely required. https://wordmaker.info/how-many/making.html

int makingAnagrams(string s1, string s2) { int b[123] = {0}; int size1 = s1.size(); int size2 = s2.size(); for(int i = 0; i < size2; i++) b[s2[i]]++; int count = 0; for(int i = 0; i < size1; i++) { if(b[s1[i]] > 0) { count++; b[s1[i]]--; } } return size1 + size2 - 2 * count; }