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

Problem of the day

You have been given a number of stairs. Initially, you are at the 0th stair, and you need to reach the Nth stair.

Each time, you can climb either one step or two steps.

You are supposed to return the number of distinct ways you can climb from the 0th step to the Nth step.

```
N=3
```

```
We can climb one step at a time i.e. {(0, 1) ,(1, 2),(2,3)} or we can climb the first two-step and then one step i.e. {(0,2),(1, 3)} or we can climb first one step and then two step i.e. {(0,1), (1,3)}.
```

Detailed explanation

```
1 <= 'T' <= 10
0 <= 'N' <= 10^5
Where 'T' is the number of test cases, and 'N' is the number of stairs.
It is guaranteed that sum of 'N' over all test cases is <= 10^5.
```

```
2
2
3
```

```
2
3
```

```
In the first test case, there are only two ways to climb the stairs, i.e. {1,1} and {2}.
In the second test case, there are three ways to climb the stairs i.e. {1,1,1} , {1,2} and {2,1}.
```

```
2
4
5
```

```
5
8
```

```
In the first test case, there are five ways to climb the stairs i.e. {1,1,1,1} , {1,1,2} , {2,1,1} , {1,2,1} , {2,2}.
In the second test case, there are eight ways to climb the stairs i.e. {1,1,1,1,1} , {1,1,1,2} , {1,1,2,1}, {1,2,1,1}, {2,1,1},{2,2,1},{2,1,2} and {2,2,1}.
```