That's a great idea. Perhaps you can do something like that?)) And we'll be glad to solve it.

Please use spoiler flag next time.

Fixed.

No answer so I consider the issue as resolved. Cheers.

Maybe my answer will not satisfy you because I don't really understand your problem all the more that many people solved the kata (218 in JS with very very good solver) and nobody complained (not a proof I know):-)
The "main cross diagonal" (function noted "diag_2_sym" to recall it is a symetry to the second diagonal) is also called (from wikipedia) "antidiagonal (sometimes counter diagonal, secondary diagonal, trailing diagonal, minor diagonal, off diagonal...". Is there something wrong and where?

You're correct thank you for the feedback! The description has been changed

I am not sure I understand completely what you are trying to say but I will attempt to explain. In your snippet, the program is checking (currentPosition >= roadmap.length) which does not imply that the ball has passed the final tile. It only means that it has reached the final tile. To check if it has passed, you must check (currentPosition > roadmap.length) instead. So the correct solution would use the example shown, meaning that the ball did not necessarily pass the final tile, but may have only reached it instead.

.

Now that you know, do this version on Node 8

if you can find out an input that makes your code fail (or better still: a pattern of inputs that make your code fail) you could suggest it to be added to tests for all languages. It's a bit hard to unravel, if you had formatted your code following the instructions in the link I gave, it would be more readable.

Your code doesn't contain a function named multiply, so it's not a solution to this kata. Please read this to learn how to post code and issues: https://docs.codewars.com/training/troubleshooting/

haha,not really, i woke up yesterday with the urge to implement long addition from scratch and I got the best example to test my implementation here. I can also confirm that my first solution was implemented 2 years ago,when I came across a small version of the BigInt library on github. Thanks for discussion, feel free to check out my other solutions to katas since I'm a 2kyu.

Well, my second solution shows the basic way of solving the kata with no cheats, hope that proves that i can solve this.

/* using Basic long addition */ its so fast with O(n) time complexity but more space is used. */

haha, bro, work smart not hard.