Prblems

Range Queries for Longest Correct Bracket Subsequence
Given a string s of length n, consisting of opening and closing brackets and an array queries[] consisting of q queries of type [start, end], where start defines the starting point and end defines the ending point. For each query, the task is to find the maximum length of the valid bracket subsequence from index start to end. Note: A correct bracket sequence has matched bracket pairs or contains another nested correct bracket sequence.
Examples:
Input: s = “())(())(())(“, start = 0, end = 11
Output: 10
Explanation: Longest Correct Bracket Subsequence is ()(())(())
Input : s = “())(())(())(“, start = 1, end = 2
Output : 0
Explanation: There is no correct bracket subsequence.