The number of steps in the staircase are given as n. You can climb atmost 3 steps at a time.
Output the number of ways you can climb the stairs modulo (10^9 + 7).
Example:
if n = 1, output = 1, because ways of climbing = { (1) }
if n = 2, output = 2, because ways of climbing = {(1,1), (2)}
if n = 3, output = 4, because ways of climbing = { (1,1,1), (1,2), (2,1), (3) }
Hint : refer tags
Solution Stats
Solution Comments
Show comments
Loading...
Problem Recent Solvers6
Suggested Problems
-
Make the vector [1 2 3 4 5 6 7 8 9 10]
52712 Solvers
-
22521 Solvers
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1991 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2536 Solvers
-
Detect a number and replace with two NaN's
199 Solvers
More from this Author5
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
