Balanced Parentheses String Validation | Dataford Interview Questions

Given a string s containing only the characters (, ), {, }, [ and ], return true if the string is balanced and false otherwise. A string is balanced if every opening bracket has a matching closing bracket of the same type and the pairs are properly nested.

Constraints

1 <= len(s) <= 10^5
s contains only the characters (, ), {, }, [ and ]
A valid solution should run in O(n) time

Function Signature

def is_balanced(s):

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

Constraints

1 <= len(s) <= 10^5
s contains only the characters (, ), {, }, [ and ]
A valid solution should run in O(n) time

Function Signature

def is_balanced(s):

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