wow! excellent.

theres always someone in the world that can turn my long code into a brilliant and elegant solution, drags me back to the valley of despair each and every time

brilliant

Really clever one , i take so long to figure out !!

thanks for the simple answer!

Just wanna say how much I liked the vars update without using a temp var. Elegant!

It happens quiet often.
Took me almost two days one Kata and the solution was terribly easy.
I felt bad then. I believe you learn a lot from frustation as well.

Same here

I made such as mess of my solution.
Looking at this, I just want to cry myself to sleep.

Hi, i am new to codewars and very impressed by this solution as it probably involves some kind of "higher math". Is somebody able and willing to explain this to a total newbie?

Because the second returns nil in this case:

If begin value is greater than the end, function should returns 0

Maybe its been updated since your comment but the description does mention the arrays will be the same length.

beautiful - but slow...

I'm forced to reply to the wrong person, but here we go

Brute force generally means to generate every possible combination until you find one that gives you an answer. In this case, it refers to starting from the bottom of the fibonacci sequence and progressing through it until you arrive at a stopping case (fib(n) * fib(n+1) >= prod).