Anagrams_HashTable.py

#Function to check two strings are anagrams or not
def anagrams(s1,s2):

    """
    we first check if both strings have the same length
    because if they're not it's impossible for them to
    be anagrams.
    """

    if len(s1) != len(s2):
        return False
    freq_1,freq_2 = {},{}

    #creating hash table for first string
    for ch in s1:
        if ch in freq_1:
            freq_1[ch] += 1
        else:
            freq_1[ch] = 1

    #creating hash table for second string
    for ch in s2:
        if ch in freq_1:
            freq_2[ch] += 1
        else:
            freq_2[ch] = 1

    #comparing two hash tables with each other
    for key in freq_2:
        if key not in freq_1 or freq_1[key] != freq_2[key]:
            return False