Stacks Bracket Balancing | Dataford Interview Questions

Solve a coding problem on stacks: balancing brackets.

Given a string containing (), [], and {}, return True if every opening bracket is closed by the correct bracket in the correct order; otherwise return False.

Implement def is_balanced_brackets(s):, where s is a string and the result is a Boolean. An empty string is balanced.

Constraints

0 <= len(s) <= 1000
s contains only the characters '(', ')', '[', ']', '{', and '}'
Each bracket must be matched by the same bracket type
Matching must respect opening and closing order

Function Signature

def is_balanced_brackets(s):

Your question is Stacks Bracket Balancing. 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