Given a string of parantheses, brackets, and curly braces, write a function that returns whether the string is well balanced, in that every left delimiter is closed by the correct right delimiter. I was asked this question by multiple interviewers, it seems like their go-to question.
