In the description, I would specify that the first length is meant to be the longer one.

The random tests expect 'False' when the first number is smaller than the second one.

Good point, I guess for no reason.
I was probably using it for something else in which I needed to specify that a is Fractional, and then I just left it as it was :P

Thanks! It works now, indeed.

I got this in the random tests:

Falsifiable (after 41 tests):
expected: 2
but got: 1
"xehtzzbajpcze"
"cjjsshesortelnxefoqgdogybqurdiqtyo"

The character 'z' does not belong to the second string, and the first string has more then one.
So, couldn't P1 win by picking 'z', and then again another 'z' after whathever P2 does?

The Haskell version is still unsubmittable.

Thank you for your reply! It was probably a bug, after I did another Kata I got all the points back.

Why on earth did I LOSE more than 1000 honor after solving this?!

There is a problem in Haskell: all testcases for negative numbers want you to leave the input unchanged, whereas the description of the problem asks to rotate the input in the other direction. So, testcases do not agree with the task description.

Indeed, you're right, subtracting r was totally unnecessary :P

Thank you for your comment!