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 <= 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.
Be the first one to answer
Add answer anonymously...
Interview Questions Asked to Associate Software Engineer at Other Companies
Top Skill-Based Questions for Micron Technology Associate Software Engineer
Data Structures Interview Questions and Answers
250 Questions
Algorithms Interview Questions and Answers
250 Questions
Java Interview Questions and Answers
250 Questions
SQL Interview Questions and Answers
250 Questions
Web Development Interview Questions and Answers
250 Questions
C++ Interview Questions and Answers
150 Questions
Stay ahead in your career. Get AmbitionBox app


Trusted by over 1.5 Crore job seekers to find their right fit company
80 L+
Reviews
10L+
Interviews
4 Cr+
Salaries
1.5 Cr+
Users
Contribute to help millions
AmbitionBox Awards
Get AmbitionBox app

