Does this solution give O(n)?

+1 to "too simple" (python)

Elixir translation awaiting approval.

The largest input is 13.

Any hint oh how big the inputs are (for Python)?

Not a chess player, so had some problems until figured out that the amazon cannot jump over the king while moving like a queen :)

Otherwise, really enjoyed the kata :)

I think you can have the same problem as I did: when moving as a queen the amazon cannot jump over figures.

So it doesn't matter that the player 0 can't pay the full penalty of 5? They just play the cards they have and the game continues?

Player 0 plays the 6, then the Jack. The Jack means that player 1 has to pay a penalty of one card or lose. Is player 1's next card a J, Q, K or A?

Thank you!

done

Would you add Python 3?