



'''simple docstring'''





from collections import defaultdict




def 							lowerCamelCase	(					_snake_case	:    str  ,_snake_case	:    str							):





    '''simple docstring'''


    lowercase__									=    first_str.lower().strip()
    lowercase__									=    second_str.lower().strip()

    # Remove whitespace
    lowercase__									=    first_str.replace(" "  ,""							)
    lowercase__									=    second_str.replace(" "  ,""							)

    # Strings of different lengths are not anagrams
    if len(_snake_case							) != len(_snake_case							):
        return False

    # Default values for count should be 0
    lowercase__									=    defaultdict(_snake_case							)

    # For each character in input strings,
    # increment count in the corresponding
    for i in range(len(_snake_case							)							):
        count[first_str[i]] += 1
        count[second_str[i]] -= 1

    return all(_count == 0 for _count in count.values()							)


if __name__ == "__main__":
 from doctest import testmod

 testmod()
 SCREAMING_SNAKE_CASE__          =  input("Enter the first string ").strip()
 SCREAMING_SNAKE_CASE__          =  input("Enter the second string ").strip()

 SCREAMING_SNAKE_CASE__          =  check_anagrams(input_a, input_b)
 print(f'''{input_a} and {input_b} are {'' if status else 'not '}anagrams.''')









'''simple docstring'''





def 							lowerCamelCase	(					_snake_case	:    int  ,_snake_case	:    int							):





    '''simple docstring'''


    return "\n".join(
        f'''{number} * {i} = {number * i}''' for i in range(1  ,number_of_terms + 1							)							)


if __name__ == "__main__":
 print(multiplication_table(number=5, number_of_terms=10))




