Quiz | on Fibonacci Numbers | Question 4

Last Updated :
Discuss
Comments

What is the time complexity of calculating the nth Fibonacci number using dynamic programming?

O(N)

O(logN)

O(2^N)

O(N^2)

This question is part of this quiz :

Quiz on Fibonacci Numbers
Tags:
DSA Quiz
Share your thoughts in the comments
We use cookies to ensure you have the best browsing experience on our website. By using our site, you acknowledge that you have read and understood our Cookie Policy & Privacy Policy