Please clarify what we have to do in this question

#1

Q; Brackets all over.

#2

Hi Shantanu,
See in this question you have to use dp(dynamic programming) to calculate how many sequences of brackets of length i has balance j and intermediate balance never goes below zero also you have to calculate for the given sequence of length n the resulting balance a and the minimum balance b.

#3

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.