Recursive method for parentheses balancing [python] [closed]

Answer 1

The way a recursive method to find closing parens would work is something like this

def findClose(chars):
    while len(chars) != 0:
        if chars[0] == ")":
            return True
        elif chars[0] == "(":
            findClose(chars[1:])

    return False       #base case

You would then just call findClose(chars) if you saw an open paren This is not complete, this is a method you can use to recursively find closing parens