Skip to content

Latest commit

 

History

History
3 lines (2 loc) · 222 Bytes

README.md

File metadata and controls

3 lines (2 loc) · 222 Bytes
Raw

Recursive Staircase Problem

There are n stairs, a person standing at the bottom wants to reach the top. The person can climb either 1 stair or 2 stairs at a time. Count the number of ways, the person can reach the top.