Longest Valid Parentheses | Dataford Interview Questions

Longest Valid Parentheses (LC 32)

Asked in the Round 2: Standard Coding stage. Implement a function that returns the length of the longest contiguous substring containing balanced parentheses.

Input and Output

Given a string s containing only ( and ), return an integer representing the maximum length of a valid parentheses substring.

Constraints

0 <= s.length <= 3 * 10^4
s contains only '(' and ')'
A valid parentheses substring has properly nested and matched parentheses

Function Signature

def longest_valid_parentheses(s):

Your question is Longest Valid Parentheses. Start with the requirements in the Question tab.

Run and submit as often as you like. When you're ready, talk me through your approach or go straight to the code.

Problem