Programmer 
Content
E Problem List E Description D Editorial Solutions Submissions 1614. Maximum Nesting Depth of the Parentheses Easy Topics A Companies 9 Hint A string is a valid parentheses string (denoted VPS) if it meets one of the following: It is an empty string "’, or a single character not equal to " (" or ")", It can be written as AB ( A concatenated with B), where A and B are VPS’s, or It can be written as (A) , where A is a VPS. We can similarly define the nesting depth depth (S) of any VPS S as follows: depth ("’) 0 depth (C) 0, where C is a string with a single character not equal to " (" or ")" depth(A B) max(depth (A) , depth (B)), where A and B are VPS’s. depth (" (" ")) 1 depth (A) , where A is a VPS. For example, a, "() ()", and "() (() ())" are VPS’s (with nesting depths 0, 1, and 2), and ") (" and "(()" are not VPS’s. Given a VPS represented as string S, return the nesting depth of Run g Submit ( Code Solved G Auto public class Solution public int MaxDepth(string 5) E Testcase Test Result Accepted untime: 93 ms Case 1 Case 2 Input " (1 (23) ( (8) 4))1" Output Expected Example 1: Input: s " (1 (23)( (8) 4))1" ProdrammerHumor.io