The Fibonacci sequence is defined as follows: the first number of the sequence is 0, the second number is 1, and the nth number is the sum of the (n - 1)th and (n - 2)th numbers. Write a function that takes in an integer n and returns the nth Fibonacci number.

Important note: the Fibonacci sequence is often defined with its first two numbers as F0 = 0 and F1 = 1. For the purpose of this question, the first Fibonacci number is F0; therefore, getNthFib(1) is equal to F0, getNthFib(2) is equal to F1, etc..

Sample Input #1

Copy
1n = 2

Sample Output #1

Copy
11 // 0, 1

Sample Input #2

Copy
1n = 6

Sample Output #2

Copy
15 // 0, 1, 1, 2, 3, 5

Hints

Hint 1

The formula to generate the nth Fibonacci number can be written as follows: F(n) = F(n - 1) + F(n - 2). Think of the case(s) for which this formula doesn’t apply (the base case(s)) and try to implement a simple recursive algorithm to find the nth Fibonacci number with this formula.

Hint 2

What are the runtime implications of solving this problem as is described in Hint #1? Can you use memoization (caching) to improve the performance of your algorithm?

Hint 3

Realize that to calculate any single Fibonacci number you only need to have the two previous Fibonacci numbers. Knowing this, can you implement an iterative algorithm to solve this question, storing only the last two Fibonacci numbers at any given time?

Optimal Space & Time Complexity

O(n) time | O(1) space - where n is the input number

Solution-1
Copy
1function getNthFib(n) {
2    let fib = [];
3  for (let i = 0; i < n; i++) {
4        if (i <= 1) {
5            fib.push(i)
6            continue;
7        }
8        fib.push(fib[i - 1] + fib[i - 2]);
9    }
10    return fib.pop()
11}
12
13// 0, 1, 1, 2, 3, 5, 8, 13
14// 2 (n-1) + (n-2) = 1 + 0
15// 6 (6-1) + (6-2) = 5 + 4 = 9

Solution-2
Copy
1function getNthFib(n) {
2  if (n === 1) return 0;
3    if (n === 2) return 1;
4    return getNthFib(n - 1) + getNthFib(n - 2);
5}

🦨