Balanced Parentheses Check | Dataford Interview Questions

How would you check whether a string of parentheses is balanced?

Implement is_balanced(s) to return True when every opening parenthesis has a matching closing parenthesis in the correct order, and False otherwise. The input contains only ( and ) characters, and an empty string is considered balanced.

Signature: def is_balanced(s):

Examples: "(())" returns True; "())(" returns False.

Constraints

0 <= len(s) <= 10^5
s contains only '(' and ')' characters
An empty string is considered balanced

Function Signature

def is_balanced(s):

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