Balanced Parentheses Coding | Dataford Interview Questions

Write a program to count the number of balanced parentheses in a string.

Given a string containing only ( and ), return the number of matched pairs. A closing parenthesis matches an earlier unmatched opening parenthesis; unmatched parentheses are ignored.

Input is a string, and output is an integer.

Example: "(()())" returns 3 because it contains three matched pairs. Example: "())(" returns 1.

Constraints

0 <= len(s) <= 1000
s contains only '(' and ')'
Count every matched pair, including pairs inside nested groups
Ignore unmatched opening and closing parentheses

Function Signature

def count_balanced_parentheses(s):

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