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).

you are trying to solve the attempts not the problem itself, try to do your soluition in a carthesian plane and see if you gets in the beginning point

if you know well about cartesian plane this question is easy.

its a really good kata, but you need a good time to figure out what you have to do to solve.

now i saw, sorry :p

this kata needs to explain that you need to manage k > arraysize