ou are given a string s, consisting of brackets of two types: '(', ')', '[' and ']'. A string is called a regular bracket sequence (RBS) if it's of one of the following type empty strin '(' + RBS + ')' '[' + RBS + ']' RBS + RBS where plus is a concatenation of two strings In one move you can choose a non-empty subsequence of the string s (not necessarily consecutive) that is an RBS, remove it from the string and concatenate the remaining parts without changing the order What is the maximum number of moves you can perfor
Correct answer will be upvoted else Multiple Downvoted. Computer science.
You are given a string s, consisting of brackets of two types: '(', ')', '[' and ']'.
A string is called a regular bracket sequence (RBS) if it's of one of the following type
empty strin
'(' + RBS + ')'
'[' + RBS + ']'
RBS + RBS
where plus is a concatenation of two strings
In one move you can choose a non-empty subsequence of the string s (not necessarily consecutive) that is an RBS, remove it from the string and concatenate the remaining parts without changing the order
What is the maximum number of moves you can perfor
Input
The first line contains a single integer t (1≤t≤1000) — the number of testcases
Each of the next t lines contains a non-empty string, consisting only of characters '(', ')', '[' and ']'. The total length of the strings over all testcases doesn't exceed 2⋅10
Output
For each testcase print a single integer — the maximum number of moves you can perform on a given string sut5..utm?r...;;g;s:on a given string s.
Step by step
Solved in 3 steps with 3 images