Problem 47154. Climbing the stairs
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 commentsProblem Recent Solvers5
Suggested Problems
-
Number of 1s in the Binary Representation of a Number
439 Solvers
-
292 Solvers
-
Spherical radius given four points
148 Solvers
-
Sum of diagonals elements of a matrix
216 Solvers
-
Return fibonacci sequence do not use loop and condition
519 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!