Balanced Brackets Check | Dataford Interview Questions

IDT messaging services may process bracketed metadata embedded in message strings. Write a function that determines whether every bracket is correctly matched and nested.

A string is balanced when each opening bracket has a matching closing bracket of the same type, brackets close in last-in, first-out order, and no closing bracket appears without a corresponding opening bracket. Supported bracket pairs are (), [], and {}. The empty string is balanced.

Formal Specification

Implement is_balanced(s), where s is a string containing only the six bracket characters (, ), [, ], {, and }. Return True if the string is balanced, otherwise return False.

Constraints

0 <= len(s) <= 10^5
s contains only the six bracket characters
Bracket types must match exactly
Brackets must be correctly nested

Function Signature

def is_balanced(s):

Your question is Balanced Brackets Check. 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