Python challenge_7

def is_anagram(string_one, string_two):
    str_dic_one = {}
    str_dic_tow = {}

    for str_one in string_one:
        if str_one in str_dic_one:
            str_dic_one[str_one] += 1
        else:
            str_dic_one[str_one] = 1

    for str_tow in string_two:
        if str_tow in str_dic_tow:
            str_dic_tow[str_tow] += 1
        else:
            str_dic_tow[str_tow] = 1

    if str_dic_one == str_dic_tow:
        return True
    else:
        return False

print(is_anagram('typhoon', 'opython'))

def is_anagram(string1, string2):
    return sorted(string1) == sorted(string2)

def count_letters(string):
    return {l: string.count(l) for l in string}

def is_anagram(string1, string2):
    return count_letters(string1) == count_letters(string2)