Which of the following is the best possible time complexity to get Nth Fibonacci number with O(1) extra space
(A) Time complexity T(n) is T(n-1) + T(n-2) which is exponential
(B) O(n)
(C) O(Logn)
(D) O(n^2)
Answer: (C)
Explanation: The best possible time complexity is O(Logn). See Program for nth Fibonacci number
Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape,
GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out -
check it out now!