Sir, I am not able to proceed. How to proceed?
Brackets all over problem
Can u mention problem link.
still can not open mention the problem name
You are given a string containing only opening and closing brackets “(” and “)” of size m. You have to append 2 strings a and b in the order a+s+b and make them valid string of size n with the following properties,
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 answer with modulo 10^9 + 7.
Sample Input
4 2
((
Sample Output
1
can you provide more test case and explain a little about test case