Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

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.

**Your Task: **

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.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Nth Fibonacci Number

...