We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Question discription is missleading and thus the solutions I see in python, though passing, seems not completly correct.
In the description:
In each move, Nick can remove one integer from the top of either stack or stack .
To my understanding, this means Nick can pick for a, then b and then a again. However from the examples and solutions in python, it seems that everyone are ignoring are ignoring it such possibility, and only including going first over 'a' and then 'b', but never going again back to 'a'
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Game of Two Stacks
You are viewing a single comment's thread. Return to all comments →
Question discription is missleading and thus the solutions I see in python, though passing, seems not completly correct. In the description:
To my understanding, this means Nick can pick for a, then b and then a again. However from the examples and solutions in python, it seems that everyone are ignoring are ignoring it such possibility, and only including going first over 'a' and then 'b', but never going again back to 'a'