Balance Parentheses Coding | Dataford Interview Questions

Intuit Management Consultancy uses rule expressions in its client-facing assessment workflow. Given a string containing parentheses, square brackets, curly braces, and other characters, determine whether every bracket is correctly matched and nested.

A bracket is valid only when it closes the most recently opened unmatched bracket of the same type. Non-bracket characters do not affect validity.

Formal Specification

Implement is_balanced(expression), which accepts a string expression and returns a boolean. Return True when all brackets are matched in the correct order, and False otherwise. An empty string or a string containing no brackets is considered balanced.

Constraints

0 <= len(expression) <= 10^5
expression contains printable ASCII characters
Only (), [], and {} are treated as brackets
Non-bracket characters do not affect validity

Function Signature

def is_balanced(expression):

Your question is Balance Parentheses Coding. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem