can you pls tell how to proceed with this problem or the logic to solve it?
Related to the problem
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 problem is based on 3D dp
you can check this code to understand
i went through the code but cant understand what is the logic behind it
check this one
Modified Code
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.