Brackets all over223

#1

i could not understand the question

#3

Hey Aastha, problem is pretty simple you will be given a string s which contains 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 given 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”

As the answer could be a large number so print the answer with modulo 10^9 + 7.