# [Leet Code] Maximum Nesting Depth of the Parentheses

LeetCode: https://leetcode.com/problems/maximum-nesting-depth-of-the-parentheses/

Problem:

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**.