longest-valid-parentheses


Submit solution

Points: 5
Time limit: 30.0s
Memory limit: 250M

Problem type
Allowed languages
Python

Given a string containing just the characters '(' and ')', return the length of the longest valid (well-formed) parentheses substring.

  Example 1:

Input: s = "(()" Output: 2 Explanation: The longest valid parentheses substring is "()".

Example 2:

Input: s = ")()())" Output: 4 Explanation: The longest valid parentheses substring is "()()".

Example 3:

Input: s = "" Output: 0

  Constraints:

0 <= s.length <= 3 * 10⁴
s[i] is '(', or ')'.

Comments

There are no comments at the moment.