Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You are given an integer ‘N’, your task is to find and return the N’th Fibonacci number using matrix exponentiation.

Since the answer can be very large, return the answer modulo 10^9 +7.

```
F(n) = F(n-1) + F(n-2),
Where, F(1) = F(2) = 1.
```

```
For ‘N’ = 5, the output will be 5.
```

Detailed explanation

```
1 <= T <= 10
1 <= N <= 10^5
Time Limit: 1 sec.
```

```
2
10
7
```

```
55
13
```

```
For the first test case, the 10th Fibonacci number is 55.
For the second test case, the 7th Fibonacci number is 13.
```

```
2
1
3
```

```
1
2
```