Amazon Interview Question - Leetcode 509: Fibonacci Number [Dynamic Programming][Recursion]

In this video, we solve a fundamental problem called Fibonacci Number by using Recursion and optimizing it further with Dynamic programming. We also discuss how to translate from exponential to polynomial time complexity.
==========================================
GET MORE EXCLUSIVE INTERVIEW QUESTIONS TO CRACK YOUR INTERVIEWS!

Subscribe to “Cracking the FAANG Interviews”:

Follow us on Facebook:

Follow on on Twitter:

CRACKING THE CODING INTERVIEW BOOK:

CRACKING THE SYSTEM DESIGN BOOK:

Apple iPad (Video recorded by):

==========================================

Leetcode link:

[crackingthefaanginterview]

Please like, share and subscribe to our channel. If you have any questions about the problem/solution - leave a comment below.

Don’t forget to HIT the BELL Icon to get more EXCLUSIVE PROBLEMS!

Best of luck!