Nth Fibonacci Number Problem Statement

Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

Input:

The input consists of a single integer ‘N’ for each test case.

Output:

Return the Nth Fibonacci number for each test case.

Example:

Input:

N = 5

Output:

5

Explanation:

The Fibonacci sequence up to the 5th term is: 1, 1, 2, 3, 5. Hence, the 5th Fibonacci number is 5.

Constraints:

1

Question

Nth Fibonacci Number Problem Statement

Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2), with initial conditions F(1) = F(2) = 1.

Input:

The input consists of a single integer ‘N’ for each test case.

Output:

Return the Nth Fibonacci number for each test case.

Example:

Input:

N = 5

Output:

Explanation:

The Fibonacci sequence up to the 5th term is: 1, 1, 2, 3, 5. Hence, the 5th Fibonacci number is 5.

Constraints:

1 <= N <= 10000
Input ‘N’ is a positive integer.

Note

You are required to implement the function and return the result. The focus is on calculating efficiently within the given time limit.

Accepted Answer

Calculate the Nth Fibonacci number efficiently using recursion or dynamic programming.

Use recursion with memoization to avoid redundant calculations.
Implement dynamic programming to store and reuse previously calculated Fibonacci numbers.
Optimize space complexity by only storing the last two Fibonacci numbers instead of the entire sequence.

Nth Fibonacci Number Problem Statement

Input:

Output:

Example:

Input:

Output:

Explanation:

Constraints:

Note

Top Standard Chartered Software Analyst interview questions & answers

Popular interview questions of Software Analyst