Background
The climbing stairs problem is a common problem in computer science and mathematics. The problem involves finding the number of different ways someone can climb a set of stairs, where each step can be taken one at a time or two at a time.
The only input to the problem is the number of stairs in the staircase. For example, if the number of stairs in the staircase is 3, we have the following ways to climb the stairs:
- 1 step, 1 step, 1 step
- 1 step, 2 steps
- 2 steps, 1 step
Therefore, the answer to the problem would be 3.