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
-
286 Solvers
-
143 Solvers
-
752 Solvers
-
Rotate input square matrix 90 degrees CCW without rot90
683 Solvers
-
Volume of a sphere given its surface area
155 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!
