How to use dp in optimal game strategy problem?

#1

I solved using recursive approach

#2

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)

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

#4

For me, video games have always been interesting not just for gameplay, but for everything happening behind the scenes especially how visual style shapes the whole experience. At some point I got curious enough to try working on a small project of my own, and that’s when I realized how important good 3D assets are. I ended up collaborating with a team that focuses on 3D modeling, just to see how a more structured pipeline works. What surprised me is that it felt less like outsourcing and more like working with developers. There were several steps involved discussing the idea, reviewing drafts, making adjustments, and then polishing everything so it fits the overall style. I came across them Game UX/UI and decided to give it a try. Their focus on 3D modeling was exactly what I needed.