# Task
 You are given two strings s and t of the same length, consisting of uppercase English letters. Your task is to find the minimum number of "replacement operations" needed to get some `anagram` of the string t from the string s. A replacement operation is performed by picking exactly one character from the string s and replacing it by some other character.

 About `anagram`: А string x is an anagram of a string y if one can get y by rearranging the letters of x. For example, the strings "MITE" and "TIME" are anagrams, so are "BABA" and "AABB", but "ABBAC" and "CAABA" are not.

# Example

 For s = "AABAA" and t = "BBAAA", the output should be 1;
 
 For s = "OVGHK" and t = "RPGUC", the output should be 4.
 
# Input/Output


 - `[input]` string `s`

    Constraints: `5 ≤ s.length ≤ 35`.


 - `[input]` string `t`

    Constraints: `t.length = s.length`.


 - `[output]` an integer

    The minimum number of replacement operations needed to get an anagram of the string t from the string s.

Difficulty: introductory

Starter code:

def create_anagram(s, t):
	

Solutions:
from collections import Counter

def create_anagram(s, t):
    return sum((Counter(s) - Counter(t)).values())

def create_anagram(s, t):
    return sum(max(0, s.count(c) - t.count(c)) for c in set(s))

def create_anagram(s, t):
    for c in s: t = t.replace(c, "", 1)
    return len(t)

def create_anagram(s, t):
    
    return sum([s.count(x)- t.count(x) if s.count(x)> t.count(x) else 0 for x in set(s)])

def create_anagram(s, t):
    return sum(max(t.count(c) - s.count(c), 0) for c in set(t))

def create_anagram(s, t):
    return sum(abs(s.count(c)-t.count(c))for c in set(s+t))/2

def create_anagram(s, t):
    for a in s:
        t = t.replace(a, '', 1)
    return len(t)

def create_anagram(s, t):
    s = list(s)
    for letter in t:
        if letter in s:
            s.remove(letter)
    return len(s)

from collections import Counter
def create_anagram(s,t):
    c_s,c_t=Counter(s),Counter(t)
    return min(sum((c_s-c_t).values()),sum((c_t-c_s).values()))

from collections import Counter

def create_anagram(s, t):
    cs, ct = Counter(s), Counter(t)
    return sum(n for _, n in (ct - cs).items())