




'''simple docstring'''







def 						snake_case_							(_a	:							Any     ):
    UpperCAmelCase			       =		[]
    UpperCAmelCase			       =		set({'''(''', '''[''', '''{'''}     )
    UpperCAmelCase			       =		set({''')''', ''']''', '''}'''}     )
    UpperCAmelCase			       =		{'''{''': '''}''', '''[''': ''']''', '''(''': ''')'''}

    for i in range(len(_a     )     ):
        if s[i] in open_brackets:
            stack.append(s[i]     )

        elif s[i] in closed_brackets and (
            len(_a     ) == 0 or (len(_a     ) > 0 and open_to_closed[stack.pop()] != s[i])
        ):
            return False

    return len(_a     ) == 0





def 						snake_case_							():
    UpperCAmelCase			       =		input('''Enter sequence of brackets: '''     )
    if is_balanced(_a     ):
        print(_a    ,   '''is balanced'''     )
    else:
        print(_a    ,   '''is not balanced'''     )


if __name__ == "__main__":
   main()










'''simple docstring'''







def 						snake_case_							(_a	:							str    ,   _a	:							str     ):
    UpperCAmelCase			       =		len(_a     ) + 1
    UpperCAmelCase			       =		len(_a     ) + 1

    # dp is a 2d matrix where dp[i][j] denotes whether prefix string of
    # length i of input_string matches with prefix string of length j of
    # given pattern.
    # "dp" stands for dynamic programming.
    UpperCAmelCase			       =		[[0 for i in range(_a     )] for j in range(_a     )]

    # since string of zero length match pattern of zero length
    UpperCAmelCase			       =		1

    # since pattern of zero length will never match with string of non-zero length
    for i in range(1    ,   _a     ):
        UpperCAmelCase			       =		0

    # since string of zero length will match with pattern where there
    # is at least one * alternatively
    for j in range(1    ,   _a     ):
        UpperCAmelCase			       =		dp[0][j - 2] if pattern[j - 1] == '''*''' else 0

    # now using bottom-up approach to find for all remaining lengths
    for i in range(1    ,   _a     ):
        for j in range(1    ,   _a     ):
            if input_string[i - 1] == pattern[j - 1] or pattern[j - 1] == ".":
                UpperCAmelCase			       =		dp[i - 1][j - 1]

            elif pattern[j - 1] == "*":
                if dp[i][j - 2] == 1:
                    UpperCAmelCase			       =		1
                elif pattern[j - 2] in (input_string[i - 1], "."):
                    UpperCAmelCase			       =		dp[i - 1][j]
                else:
                    UpperCAmelCase			       =		0
            else:
                UpperCAmelCase			       =		0

    return bool(dp[-1][-1]     )


if __name__ == "__main__":
   import doctest

   doctest.testmod()
   # inputing the strings
   # input_string = input("input a string :")
   # pattern = input("input a pattern :")

   A     ='aab'
   A     ='c*a*b'

   # using function to check whether given string matches the given pattern
   if match_pattern(input_string, pattern):
      print(f"""{input_string} matches the given pattern {pattern}""")
   else:
      print(f"""{input_string} does not match with the given pattern {pattern}""")




