Leetcode 1614. Maximum Nesting Depth of the Parentheses

Given a valid parentheses string, compute its maximum nesting depth — the largest number of parentheses that are open at the same time. (Equivalent to scanning the string and tracking the peak count of '(' minus ')'.)