Balanced Parentheses Check | Dataford Interview Questions

How would you implement a function to check for balanced parentheses?

Implement is_balanced(s), where s contains only ( and ). Return True when every opening parenthesis is closed in the correct order, and False otherwise. An empty string is balanced.

Function Contract

Input: a string s
Output: a Boolean

Constraints

0 <= len(s) <= 10^4
s contains only '(' and ')'
Return a Boolean value

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