Approved

I added one example with 5 steps.

It should be clear that in order to get from step 1 to 5, there should be at least 4 instructions.

from say step 2 to 5 or 1 to 4, there should be at least 3 instructions.

from 1 to 3, 2 to 4, 3 to 5, 2 instructions.

you get my point? The graphs that I made have multiple examples within that are "subarrays" of the example with most instructions.

either way, the suggestion won't be implemented, as it would invalidate too many results on an approved kata

for me, it was not clear at all from the description, which sequences to include and which to discard

.

Approved

perhaps the restrictions aren't tight enough

resolved

Well, there's no happiness without suffering; congrats on solving!

Though you're making me question whether I should add a barrier against hardcoding...

biggest number in sample test is if i am not wrong something like ~400th Fibonacci number. in random tests they starting from ~500 000th Fibonacci number, so there is no way to calculate square root of that in reasonable amount of time

i will translate to python probably tomorrow. by the way how do you test squares ? because if you test it searching for root there is no chance to handle those numbers

I have now added some random tests! Thanks for the reminder.

Added 100 random tests.

thank you!
I will read through this and implement random tests.

It looks like generating random arrays takes most of the time. The ref solution is very fast.