Problem Description
Given an integer A you need to find the Ath fibonacci number modulo 109 + 7.
The first fibonacci number F1 = 1
The first fibonacci number F2 = 1
The nth fibonacci number Fn = Fn-1 + Fn-2 (n > 2)
1 <= A <= 109.
First argument is an integer A.
Return a single integer denoting Ath fibonacci number modulo 109 + 7.
Input 1:
A = 4
Input 2:
A = 3
Output 1:
3
Output 2:
2
Explanation 1:
F3 = F2 + F1 = 1 + 1 = 2 F4 = F3 + F2 = 2 + 1 = 3
Explanation 2:
F3 = F2 + F1 = 1 + 1 = 2
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a question? Checkout Sample Codes for more details.
1 Million +
Strong Tech Community500 +
Questions to Practice100 +
Expert Interview Guides
