LeetCode Fibonacci Number Solution Explained - Java

[@ethanscottt]

God bless you nick for always finding the best time complexity

[@HugoAyala1983]

Cracking the Code Interview by Gayle McDowell illustrates this approach, but Nick's explanation is superb!

[@RichardRajah]

i liked you rant towards the end... and i feel the same

[@LazyShady]

Well, its 2021. I had this question in my intreview.

[@Explore-world-]

any big tech??

[@tylermarcum1307]

Yeah…I must have had a weird interview.

[@majone1231]

If you aren't doing functions and recursions as a beginner how would you implement fib n-1 and n-2?

[@coffeeguy700]

Yeah i want know simple version before use that recursion method

[@GuitarreroDaniel]

@@coffeeguy700 There's no other way.

[@juliuscecilia6005]

Is the first sum = a +b necessary (before the while loop)?

[@dp4kallday]

No, he could have initialized sum to 0 and it would have worked the same. Its simply a place holder and gets over written by the calculation in the while loop.

[@sigma7253]

can u explain in o(logn)

[@taetaebahohiningamo]

thanks nick!!!

[@raghavendrar6189]

Can please explain nth prime number

[@_VeerKumar]

You r such a great guy Nickkkkkkkkkkk