Given a string consisting of opening and closing parenthesis, find length of the longest valid parenthesis substring. An Efficient Solution can solve this problem in O(n) time. The idea is to store ...

# find the length of the longest valid (well-formed) parentheses substring. # For "(()", the longest valid parentheses substring is "()", which has length = 2 ...