443. Basic Stack Bracket Depth

Given a string s containing only parentheses '(' and ')', use a stack-like approach (or a simple counter) to find the maximum nesting depth of the parentheses. The input string is guaranteed to be well-formed (balanced). For example, "(()(()))" has a depth of 3.

Run this challenge interactively in Python or JavaScript when the app loads.