def is_permutation_nocounter(str_1, str_2) -> bool:
    """Check if str_1 and str_2 are permutations of each other
    Use str.count to calculate appearance frequency of each unique character

    Arguments:
    str_1 -- first string
    str_2 -- other string

    Returns:
    True if str_1 is permutation of str_2
    False otherwise

    Raises:
    TypeError if one of arguments is not a builtins.str or not any subclass of str
    """
    if not isinstance(str_1, str) or not isinstance(str_2, str):
        raise TypeError
    if len(str_1) != len(str_2):
        return False
    str_1_char_freq = { char: str_1.count(char) for char in set(str_1) }
    str_2_char_freq = { char: str_2.count(char) for char in set(str_2) }
    is_permutation_result = (str_1_char_freq == str_2_char_freq)
    return is_permutation_result