Haskell translation

looks resolved

Thank you) everything work well

python fork

changes:

• copy input to user to avoid confusion when user mutates (this is why I am touching it to begin with)
• remove redundant describes (only contained one it, describe is for grouping)
• custom formatted error messages to include what the input was
• replace parts of test generation with equivalent calls to the random module

don't mutate the input

Can anyone help me with this? I've passed 157 and failed 149 test. One an example from it.
test_list=[2065, -349, 472, 70, -383, 173, -63, 192, 35, 89, -87, -74, 449, 256, -129, 298, 164, 85, -445, 441, 433, -170, 313, 360, 190, -449, -148, 67, 217, 80, -59, 146, 375, -24, -460, 0]
I take:
left=2065
right=0
left+right == sum (rest of list)
2065 + 0 == 2065
Therefore, must be return [left]+lst+[right]
BUT it says that right is [-349, 472, 70, -383, 173, -63, 192, 35, 89, -87, -74, 449, 256, -129, 298, 164, 85, -445, 441, 433, -170, 313, 360, 190, -449, -148, 67, 217, 80, -59, 146, 375, -24, -460]
Thank you)

Javascript translation posted

Ruby Translation

Rust translation

Javascript translation

I see no difference. Did you remove cases that actually test ties?

The pawn is always in the last row as it will now turn into one of the four pieces ...

This is explicit. If you are not satisfied with it, make a concrete suggestion.