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
Solve

Solution Stats

28 Solutions

7 Solvers

Last Solution submitted on May 30, 2026

Last 200 Solutions

Solution Comments

Show comments

Problem Recent Solvers7

Binbin Qi Chris Cleveland David Hill Ramon Villamangca

Suggested Problems

More from this Author5

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!