Test case unclear
\n\n[1,1,7,10,8,17,10,20,2,10]\n\nOutput : True\n\n\nI am missing something in this test case.\n\nMy manual understand of stones taken out and removed stone sum
```\n\n[1,1,7,10,8,17,10,20,2,10]\n\nOutput : True\n```\n\nI am missing something in this test case.\n\nMy manual understand of stones taken out and removed stone sum is this -\n\n```\n\n[1,1,8,7,17,10,20,10,2,10]\n\nand removed sum is -\n\n[1,2,10,17,34,44,64,74,76,86]\n\n```\n\nAt the end of this, its now Alice\'s turn but no stones are left. Since none of these removed sums are divisible by 3, \n\nand this part of the question "Bob will win automatically if there are no remaining stones (even if it is Alice\'s turn).", the answer should be False (or Bob wins)\n\nCan someone explain this?\n\n
[]