please provide any hints .
How to approach this question
Brackets All Over help
You are given a string which contains only ‘(’ and ‘)’. Size of the string will be m. You have to append two strings one in prefix and another one in suffix to make that string valid and conditions for validity are given below:
- At any index, number of opening brackets should be greater than closing brackets
- No. of opening and closing brackets should be equal. You have to tell number of combinations of string a and b if its possible, otherwise print “0” Print the asnwer with modulo 10^9 + 7.
this is not a hint , it is the question itself. PLease give some kind of hint or tell me a similar question??
the problem says that you are given a string s, it’s length m and a number n. You have generate all possible pairs of a and b such that:
a + s + b is a valid sequence of brackets of length exactly n.
For example if you are given s = “))” and n = 6(m = 2 obviously) then you can generate following pairs of a and b to make a+s+b a valid sequence:
“()((” “))” “” // Remeber a and b can be blank also.
“((” “))” “()”
“(((” “))” “)”
“(()(” “))” “”
“((()” “))” “”
Hence, the ans for this testcase is 5. If there is no possible combination then print -1. Pls try the question now.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.