428. Balanced Bracket Sequence Depth

Given a string s consisting only of parentheses '(' and ')', find the maximum nesting depth of the parentheses. The string is guaranteed to be a valid sequence (i.e., it forms a balanced bracket sequence). Use a stack-like approach (or counter) to track the depth.

Example:
Input: s = "(()(()))"
Output: 3

Input: s = "()()"
Output: 1

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