Bracket all over question

pls explain the question i am unable to understand the test cases

Hey Ankush, 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.

Hey, as you are not responding to this thread, I am marking your doubt as Resolved for now. Re-open it if required.

Please mark your doubts as resolved in your course’s “ Ask Doubt ” section, when your doubt is resolved.