You are given a string ‘S’ containing only the characters ‘)’ and ‘(‘. You need to find the length of the longest valid i.e. well-formed parentheses substring.
Let the given string be “(()())((”.
Here the valid parentheses substrings are: “()”, “()” and “(()())”. Out of these the longest valid string is “(()())” which has a length 6.
The first line of input contains an integer ‘T’ representing the number of test cases.
The first and the only line of every test case contains the string S.
For each test case, the length of the longest valid (well-formed) parentheses substring is printed.
The output for each test case is printed in a separate line.
You don’t need to print anything. It has already been taken care of. Just implement the given function.
1 <= T <= 100
1 <= Length(S) <= 10^4
Where ‘T’ is the number of test cases and ‘S’ is the given string.
Time Limit: 1sec
Sample Input 1:
Sample Output 1:
Explanation For Sample Input 1:
For the first test case, the longest valid (well-formed) parentheses substring is “()()” with length 4.
For the second test case, there is no valid parentheses substring. Hence, the output is 0.
Sample Input 2:
Sample Output 2: