Balanced Parentheses Implementation | Dataford Interview Questions

Uniphore Software Systems processes structured text in conversational transcripts. Given a transcript fragment containing parentheses and bracket characters, determine whether every opening delimiter is closed with the correct type and in the correct order.

Supported delimiter pairs are (), [], and {}. All other characters, including letters, digits, spaces, and punctuation, must be ignored. An empty string is considered balanced.

Formal Specification

Implement is_balanced(text), where text is a string. Return True if all delimiters are balanced and properly nested; otherwise, return False.

Constraints

0 <= len(text) <= 10^5
text contains ASCII characters
Only (), [], and {} affect validity

Function Signature

def is_balanced(text):

Your question is Balanced Parentheses Implementation. 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