How to use dp in optimal game strategy problem?

I solved using recursive approach

Hey @jha.aparna17
See there are two vars starting index of array and ending index of array
So u have to create a 2d matrix to memorize ur recusive solution

save dp[i][j]=max(op1,op2)

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.