the stone problem seems like a subset sum problem case…i can count how many times the func is being called if it is odd player1 wins if it is even player 2 wins
Cant i solve this problem as subset sum to given target?
@neha_153,
And how would you ensure optimal play in your logic?
Assuming that both players play optimally, determine the winner.
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.