Something is missing from the description. It talks about making optimal move but each move is to take an integer from the front of array as it moves along. What do they mean by taking turns? if each must take the first element in the array/queue then how do they make the best choice? There are no choices, they just get the item in the front of the array. I really wish they would edit the descriptions better.

here is problem solution in java python c++ and c programming. https://programs.programmingoneonone.com/2021/07/hackerrank-new-year-game-problem-solution.html

Once you recognize the most important invariant, you can see that there's actually only a few truly distinct possible games, and then it's simple to just go through them manually and check who wins each one.

why it has 5 inputs ?

2 3 7 6 18 1 3

what does other input means I dont understand the use of them.

it's working perfectly in my ide(for any case) and for 0 test case also but it's giveing some error for other test cases but i thinke it is perfect code, so,plezz anybody can tell me wath's worng with it. // Write Your Code Here int sb=0,sk=0,j; // srand(time(0)); for(int i=0;i else sk+=a[j]; while(j } if(sb>sk){ if((sb-sk)%3==0) printf("Koca"); else printf("Balsa"); printf("\n"); } else{ if((sk-sb)%3==0) printf("Balsa"); else printf("Koca"); printf("\n"); }