> This isn't that hard of a problem, and if an interview candidate couldn't come up with a basic solution like this, I'd very much like to know that. def is

> This isn't that hard of a problem, and if an interview candidate couldn't come up with a basic solution like this, I'd very much like to know that. def is_balanced_parens(s): return s.count('(') == s.count(')') Think I'd fail the interview test...