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
-
Back to basics 21 - Matrix replicating
1797 Solvers
-
Write a function man that takes a row vector v and returns a matrix H as follows..
647 Solvers
-
Test Problem; Create a 5x5 array containing all ones
405 Solvers
-
Matrix of almost all zeros, except for main diagonal
191 Solvers
-
851 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!
