**Recursion: Davis' Staircase**

### Problem Statement :

Davis has a number of staircases in his house and he likes to climb each staircase 1, 2, or 3 steps at a time. Being a very precocious child, he wonders how many ways there are to reach the top of the staircase. Given the respective heights for each of the staircases in his house, find and print the number of ways he can climb each staircase, module 10^10 + 7 on a new line. Example n = 5 The staircase has 5 steps. Davis can step on the following sequences of steps: 1 1 1 1 1 1 1 1 2 1 1 2 1 1 2 1 1 2 1 1 1 1 2 2 2 2 1 2 1 2 1 1 3 1 3 1 3 1 1 2 3 3 2 Function Description Complete the stepPerms function using recursion in the editor below. stepPerms has the following parameter(s): int n: the number of stairs in the staircase Returns int: the number of ways Davis can climb the staircase, modulo 10000000007 Input Format The first line contains a single integer, s, the number of staircases in his house. Each of the following s lines contains a single integer, n, the height of staircase i. Constraints 1 <= s <= 5 1 <= n <= 36

### Solution :

` ````
Solution in C++ :
In C++ :
#include <bits/stdc++.h>
#define MOD 10000000007
using namespace std;
int dp[100001], n;
int count_paths(int i) {
if(i == 0)
return 1;
if(i < 0)
return 0;
if(dp[i] != -1)
return dp[i];
dp[i] = count_paths(i - 1) % MOD;
dp[i] = (dp[i] + count_paths(i - 2)) % MOD;
dp[i] = (dp[i] + count_paths(i - 3)) % MOD;
return dp[i];
}
int main() {
int t;
cin >> t;
assert(t >=1 and t<= 5);
for(int i = 0; i < t; i++) {
cin >> n;
assert(n >= 1 and n <= 100000);
memset(dp, -1, sizeof dp);
int ans = count_paths(n);
cout << ans << endl;
}
return 0;
}
```

` ````
Solution in Java :
In Java :
import java.util.*;
class Solution {
final static long _MOD = 1000000007;
public static long countPathsMemoized(int numberOfSteps) {
long[] memo = new long[numberOfSteps + 1];
long numberOfWays = 1;
for(int i = 1; i < numberOfSteps; i++) {
numberOfWays += countPathsMemoized(i, memo);
}
return numberOfWays % _MOD;
}
public static long countPathsMemoized(int numberOfSteps, long[] memo) {
if(numberOfSteps < 3) {
return (numberOfSteps > 0) ? numberOfSteps : 0;
}
if(memo[numberOfSteps] == 0) {
memo[numberOfSteps] = (
countPathsMemoized(numberOfSteps - 1, memo)
+ countPathsMemoized(numberOfSteps - 2, memo)
+ countPathsMemoized(numberOfSteps - 3, memo)
) % _MOD;
}
return memo[numberOfSteps];
}
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
int numberOfStaircases = scanner.nextInt();
while(numberOfStaircases-- > 0) {
int numberOfSteps = scanner.nextInt();
System.out.println(countPathsMemoized(numberOfSteps));
}
scanner.close();
}
}
```

` ````
Solution in Python :
In Python3 :
def stepPerms(n):
f1, f2, f3 = 1, 2, 4
for i in range(n-1):
f1, f2, f3 = f2, f3, f1 + f2 + f3
return f1
```

## View More Similar Problems

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →