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

The program calculates the Nth Fibonacci number using a recursive formula.

The Fibonacci series starts with 1, 1, and each subsequent number is the sum of the two preceding numbers.
The program uses a recursive function to calculate the Nth Fibonacci number.
The time complexity of the program is O(2^N), which can be optimized using memoization or dynamic programming.

Asked in Grey Orange

Nth Fibonacci Number Problem Statement

Input:

Output:

Example:

Input:

Output:

Explanation:

Constraints:

Note

Interview Questions Asked to Software Engineer at Other Companies

Top Skill-Based Questions for Grey Orange Software Engineer