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
-
The Goldbach Conjecture, Part 2
2413 Solvers
-
981 Solvers
-
Return a list sorted by number of consecutive occurrences
427 Solvers
-
Number of odd and even elements within matrix
159 Solvers
-
1706 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!
