You're welcome :)

call me razzed

razzing us up, are you?

Thanks for mentioning this. Due to the convoluted setup of the tests (C++) I got a non-explaining runtime error and would have had to guess otherwise.

why ?

depending of the language this could an 5kyo

new programers think that oneliners solutions are good so they upvote them

you really need to undertand the math sintaxe to do this kata, but maybe an AI can help you to describe the math formula for you :D

you mean recursive function, do you?

this kata should be 6 kyu if the math at it was obvious.

for me this worked, but maybe for doing in C++

this kata is very interesting, i built my own fibonnaci formula inside my answer but, some people had a way to do this with simple math i didnt undertood how this work, but since my goal inst math but programming, so i think my answer is valid

to debug the solution put print(array), to see in what case your solution is failing and debug in another platform

i dont understand your point, in this case if the algorithm isnt timed out and works, its worthly, not em real scenarios like big data, but if the person can do this algorithm like O(n^2) or even o(n^3), once thsi get an solution with some improvements and searchs, the person could make the algoritm O(n) or maybe (nlogn)(in this case i dont know if its possible).

Tests are missing for IndexOutOfBoundsException. If you solve the problem with 11x11 matrix and receive an input with 6 steps in a row in a single direction, than you can hit index-out-of-bounds. This sort of valid, because any larger than that and the output would be FALSE - if you take 6 steps in one direction you cannot return with 4, but still I would add a test to make sure the solutions catch invalid inputs.