Optimal_game strategy problem

#1

sir i want to do this question with the help of bottom up approach .
how can i do this

#2

hi anuj
F(i, j) represents the maximum value the user can collect from
i’th coin to j’th coin.

F(i, j)  = Max(Vi + min(F(i+2, j), F(i+1, j-1) ), 
               Vj + min(F(i+1, j-1), F(i, j-2) ))

Base Cases
F(i, j) = Vi If j == i
F(i, j) = max(Vi, Vj) If j == i+1
Fill the dp table using the above recursive formula.
Note that the table is filled in diagonal fashion
try forming the dp equations. if you still not understand you can message further

#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.