I used reverse list to do it. But I figured out how you did it, by building the list backwards by adding infront of the list. Nice I never thought of that.

JavaScript translation

how does codewars determine what order your code gets posted if the sorting is according to best practices? I come in 7th place alot for some reason

"with out" ??
It doesn't use any reverse list

Nice solution. How does it work with out using any reverse list? like [::-1] ?

ok thanks

If the requested string length is smaller than or equal to 3 characters, then the length of the dots is not added to the string length.

e.g. trim("He", 1) should return "H...", because 1 <= 3

It's already there and with an example. What is it that confuses you?

description needs to be clearer about the max length if size is 3 or less!
i.e. if size is 3 or less then total size does not have to count the '...' added to the end

how do you solve the 3 equations? what method?

This kata is only one knight move. But I made a more advanced version in kumite for Two moves...

There should be tests where the knight can return to the origin either 0 move, or more than 1 move.

• https://docs.codewars.com/authoring/guidelines/kata
• https://docs.codewars.com/languages/python/codewars-test

Im still trying to figure out how to write tests. need help with that...

Hi,

• no sample tests
• no random tests

Cheers