Maximum Nesting Depth
Beginner
s is a valid string of parentheses mixed with other characters (every ( has a matching )). Return the maximum nesting depth: the largest number of ( that are open at the same time.
Examples
Example 1
Input:
max_nesting_depth('(1+(2*3)+((8)/4))+1')
Output:
3
Example 2
Input:
max_nesting_depth('abc')
Output:
0
Constraints
0 <= len(s) <= 3 * 10**5- The parentheses in
sare balanced and correctly ordered.
Theory
Go to TheoryKeywords
dsa-sheetstringsstring-basics
Run your code to see results
No results yet
Run your code to check it against the examples, or submit to run every test.