title: Recursive method for parentheses balancing [python]
body: <p>Anyone have any idea how to write a function that balances parentheses using recursion?</p>
  
  <p>I was thinking of counting the number of times each outer or inner parenthesis pops up in a string, but then it would miss cases like this "()())()(" or this ")(".</p>
  
  <p>My instructor had examples of recursion that solved factorials and calculated numbers of the fibonacci sequence, but she never really went over solving other types of problems.</p>