wow, so good

This is Javascript haha

Try 100-codePointAt(0)

что-то на церковном

The two knights have not collided in your output.

for vKnightLeft = 1, vKnightRight = 1 and field:
["$->     ","     <-P"]
: expected [ ' $->    ', '    <-P ' ] to deeply equal [ '  $->   ', '   <-P  ' ]

You must use markdown to format logs, just like you would do for code, because consecutive spaces are not printed properly, see there: https://docs.codewars.com/training/troubleshooting/#post-discourse

I see the similar question below, but don't see the solution.

Please tell me why my result is wrong?

for vKnightLeft = 1, vKnightRight = 1 and field:
["$->11111","11111<-P"]
: expected [ '1$->1111', '1111<-P1' ] to deeply equal [ '11$->111', '111<-P11' ]

In the result, substrings (a substring is for example 2:nnnnn or 1:hhh; it contains the prefix)

Because of that ^

JS

Could someone explain why it is correct order?

1:gg/2:ee/2:ff/2:ii/2:oo/2:rr/2:ss/2:tt

I use codePointAt

'g' is 103,
'e' is 101,
'i' is 105,
'o' is 111,

For a given nonempty string s find a minimum substring t and the maximum number k, such that the entire string s is equal to t repeated k times.

That would be true if the string was "abcabc".

could someone explain why it is worng

initial string is "abcoabc"

expected [ 'abc', 2 ] to deeply equal [ 'abcoabc', 1 ]

.