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 ')'.)
Asked at:
Meta
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Mid February, 2026
Meta
Mid-level
Asked exact same question
Hello Interview Premium
Your account is free and you can post anonymously if you choose.