Agreed. Recursive fibonacci will freeze on n=100. I had to rack my brain to implement different approach which was a great exercise.

Update:
I found out for some reason a variable was getting a value from somewhere... no idea where it comes from as I declared the int with 0 and then strangely it would have a
value of 20 before doing a loop... fixed by declaring it to 0 right before the loop

Does anyone know why the exact same code that I copy and paste from my Eclipse doesn't give me the right resuts in this browser,

but gives the right results in eclipse? I made sure the class names are all correct, but for some reason test 1 works fine but test 2 and 3 the returns are off. In eclipse my

code works totally fine. Any help appreciated, thanks!

Thanks for your kind feedback!

I really found this helpful for trying to figure out more efficient ways to execute the same code. This exercise also made me "think big" when considering algorithms and the amount of data that needs to be processed. Because of this kata I stumbled upon some helpful information about different data structures, which was also helpful. Thanks to the author!