Not able to understand this question

#1

could you please explain the question in simple terms…:slight_smile:

#2

Hey @raghurajj
So it is a simple DP Game theory question where players take turn and last one to move will win
The interesting part is that second player can divide the string into 2 games
Which basically means
Calculate 2D dp for the string for each pair position i, j
In the end simply find if there exists i such that s[0,i] and s[i+1,n] both are losing configurations

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