Balanced Brackets Algorithm | Dataford Interview Questions

Given a string of parenthesis (ex. "{[()]}", write an algorithm to determine whether or not they are balanced.

Implement is_balanced(s) using a stack. The input contains only (, ), [, ], {, and } characters, and an empty string is balanced. Return True when every opening bracket has the correct closing bracket in the correct order; otherwise, return `False.

Constraints

0 <= len(s) <= 10^4
s contains only the characters (, ), [, ], {, and }

Function Signature

def is_balanced(s):

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

Given a string of parenthesis (ex. "{[()]}", write an algorithm to determine whether or not they are balanced.

Constraints

0 <= len(s) <= 10^4
s contains only the characters (, ), [, ], {, and }

Function Signature

def is_balanced(s):

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