#925Hard#6 in Morgan Stanley's list· asked at 16 companies
Longest Valid Parentheses
Hosted on LeetCode
Solve it on LeetCode, track it here.
This problem's full statement lives on LeetCode. Open it in a new tab, then come back to mark it solved, add notes and keep your streak.
LeetCode Premium locked?
Most company-tagged LeetCode problems are behind Premium. If you have ChatGPT Plus or Claude Pro, ask it for the full statement, examples and constraints. The buttons below open a chat with the prompt already filled in.
What we know
Example 1
Input: s = "(()" Output: 2
The longest valid substring is "()".
Example 2
Input: s = ")()())" Output: 4
The longest valid substring is "()()".
Example 3
Input: s = "" Output: 0
Constraints
- •
0 <= s.length <= 3 * 10^4 - •
s[i]is '(' or ')'.