**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

## Inserting a Node Into a Sorted Doubly Linked List

Given a reference to the head of a doubly-linked list and an integer ,data , create a new DoublyLinkedListNode object having data value data and insert it at the proper location to maintain the sort. Example head refers to the list 1 <-> 2 <-> 4 - > NULL. data = 3 Return a reference to the new list: 1 <-> 2 <-> 4 - > NULL , Function Description Complete the sortedInsert function

View Solution →## Reverse a doubly linked list

This challenge is part of a tutorial track by MyCodeSchool Given the pointer to the head node of a doubly linked list, reverse the order of the nodes in place. That is, change the next and prev pointers of the nodes so that the direction of the list is reversed. Return a reference to the head node of the reversed list. Note: The head node might be NULL to indicate that the list is empty.

View Solution →## Tree: Preorder Traversal

Complete the preorder function in the editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's preorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the preOrder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the tree's

View Solution →## Tree: Postorder Traversal

Complete the postorder function in the editor below. It received 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's postorder traversal as a single line of space-separated values. Input Format Our test code passes the root node of a binary tree to the postorder function. Constraints 1 <= Nodes in the tree <= 500 Output Format Print the

View Solution →## Tree: Inorder Traversal

In this challenge, you are required to implement inorder traversal of a tree. Complete the inorder function in your editor below, which has 1 parameter: a pointer to the root of a binary tree. It must print the values in the tree's inorder traversal as a single line of space-separated values. Input Format Our hidden tester code passes the root node of a binary tree to your $inOrder* func

View Solution →## Tree: Height of a Binary Tree

The height of a binary tree is the number of edges between the tree's root and its furthest leaf. For example, the following binary tree is of height : image Function Description Complete the getHeight or height function in the editor. It must return the height of a binary tree as an integer. getHeight or height has the following parameter(s): root: a reference to the root of a binary

View Solution →