My code only passes testcase-3 while the rest of the fails. I am not able to find the bug in it.
Here is the code link: https://ide.codingblocks.com/s/342716
Optimal Game Strategy Problem
hello @nikhil015
greedy will not work here becuase both the players are playing optimally.
here is the approach->
we would need an optimal solution for this. At each instance we would need to consider two possibilities that we can pick the first as well as the last element of the remaining array. Both these possibilities give rise to two more possibilities depending on the other player. Since the second player plays optimally and try to minimise our score. So overall we have two possibilities at each instance.
For the first possibility , where we could pick the first element , the other player will pick the next element from the side that would minimise our total score.
Similarly , for the second possibility , where we can pick the last element , the other player would still pick the next element from the side that would minimise our total score.
We entertain both these cases and take the maximum result of the two and return that result.
We take two pointer variables , say ‘i’ and ‘j’ which each represent the starting and the ending point of the remaining array currently in consideration. We work till the two pointers cross each other.
code->
@aman212yadav
I am confused about taking the min. Since we want our score to be maximum then why we take the min. I am still not able to understand it.
we are taking min when oponent is playing.
becuase oponent is also playing optimally , he will try to maximize his score and due to which our result will get minimise and that is the reason why we are taking min and not max .
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.