X

DAYS

:

HOUR

:

MINS

:

SEC

Copied to Clipboard
Nth Fibonacci Number
Easy Accuracy: 41.85% Submissions: 47458 Points: 2

Given a positive integer n, find the nth fibonacci number. Since the answer can be very large, return the answer modulo 1000000007.

Example 1:

Input: n = 2
Output: 1
Explanation: 1 is the 2nd number
of fibonacci series.


Example 2:

Input: n = 5
Output: 5
Explanation: 5 is the 5th number
of fibonacci series.


You dont need to read input or print anything. Complete the function nthFibonacci() which takes n as input parameter and returns nth fibonacci number.

Expected Time Complexity: O(n)
Expected Auxiliary Space: O(n)

Constraints:
1<= n <=1000

We are replacing the old Disqus forum with the new Discussions section given below.