**A Flight of Stairs - Amazon Top Interview Questions**

### Problem Statement :

There's a staircase with n steps, and you can climb up either 1 or 2 steps at a time. Given an integer n, write a function that returns the number of unique ways you can climb the staircase. The order of the steps matters, so each different order of steps counts as a way. Mod the result by 10 ** 9 + 7. Constraints n ≤ 100,000 Example 1 Input n = 4 Output 5 Explanation There are 5 unique ways: 1, 1, 1, 1 2, 1, 1 1, 2, 1 1, 1, 2 2, 2 Example 2 Input n = 1 Output 1 Explanation There's only one way: climb up 1 step. Example 3 Input n = 3 Output 3 Explanation There are three ways: [1, 1, 1], [2, 1], and [1, 2].

### Solution :

` ````
Solution in C++ :
const int mod = 1e9 + 7;
struct mtx {
long long int a, b, c, d;
mtx(long long int w, long long int x, long long int y, long long int z)
: a(w), b(x), c(y), d(z) {
}
mtx operator*(mtx& other) {
mtx A(a * other.a + b * other.c, a * other.b + b * other.d, c * other.a + d * other.c,
c * other.b + d * other.d);
A.a %= mod;
A.b %= mod;
A.c %= mod;
A.d %= mod;
return A;
}
};
mtx power(mtx A, long long int k) {
mtx B(1, 0, 0, 1);
while (k) {
if (k & 1) {
B = B * A;
}
A = A * A;
k /= 2;
}
return B;
}
int solve(int n) {
mtx A(1, 1, 1, 0);
mtx B = power(A, n);
// cout << B.a << " " << B.b << endl << B.c << " " << B.d << endl;
return B.a;
}
```

` ````
Solution in Java :
import java.util.*;
class Solution {
public int solve(int n) {
int a = 1;
int b = 1;
int c;
for (int i = 2; i <= n; i++) {
c = a;
a = b;
b = (b + c) % 1000000007;
}
return b;
}
}
```

` ````
Solution in Python :
class Solution:
def solve(self, n):
MOD = 10 ** 9 + 7
def fib():
a = b = 1
yield a
yield b
while True:
yield (a + b) % MOD
a, b = b, (a + b) % MOD
f = fib()
for _ in range(n):
next(f)
return next(f)
```

## View More Similar Problems

## Array-DS

An array is a type of data structure that stores elements of the same type in a contiguous block of memory. In an array, A, of size N, each memory location has some unique index, i (where 0<=i<N), that can be referenced as A[i] or Ai. Reverse an array of integers. Note: If you've already solved our C++ domain's Arrays Introduction challenge, you may want to skip this. Example: A=[1,2,3

View Solution →## 2D Array-DS

Given a 6*6 2D Array, arr: 1 1 1 0 0 0 0 1 0 0 0 0 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 An hourglass in A is a subset of values with indices falling in this pattern in arr's graphical representation: a b c d e f g There are 16 hourglasses in arr. An hourglass sum is the sum of an hourglass' values. Calculate the hourglass sum for every hourglass in arr, then print t

View Solution →## Dynamic Array

Create a list, seqList, of n empty sequences, where each sequence is indexed from 0 to n-1. The elements within each of the n sequences also use 0-indexing. Create an integer, lastAnswer, and initialize it to 0. There are 2 types of queries that can be performed on the list of sequences: 1. Query: 1 x y a. Find the sequence, seq, at index ((x xor lastAnswer)%n) in seqList.

View Solution →## Left Rotation

A left rotation operation on an array of size n shifts each of the array's elements 1 unit to the left. Given an integer, d, rotate the array that many steps left and return the result. Example: d=2 arr=[1,2,3,4,5] After 2 rotations, arr'=[3,4,5,1,2]. Function Description: Complete the rotateLeft function in the editor below. rotateLeft has the following parameters: 1. int d

View Solution →## Sparse Arrays

There is a collection of input strings and a collection of query strings. For each query string, determine how many times it occurs in the list of input strings. Return an array of the results. Example: strings=['ab', 'ab', 'abc'] queries=['ab', 'abc', 'bc'] There are instances of 'ab', 1 of 'abc' and 0 of 'bc'. For each query, add an element to the return array, results=[2,1,0]. Fun

View Solution →## Array Manipulation

Starting with a 1-indexed array of zeros and a list of operations, for each operation add a value to each of the array element between two given indices, inclusive. Once all operations have been performed, return the maximum value in the array. Example: n=10 queries=[[1,5,3], [4,8,7], [6,9,1]] Queries are interpreted as follows: a b k 1 5 3 4 8 7 6 9 1 Add the valu

View Solution →