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 Solvers8
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1331 Solvers
-
Put two time series onto the same time basis
359 Solvers
-
Sum the elements in either diagonal of a square matrix
223 Solvers
-
Find elements of set A those are not in set B
72 Solvers
-
Sums of cubes and squares of sums
383 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!
