Climbing Stairs | Leetcode #70 | Easy

In this post I will discuss the solution to the leetcode problem — Climbing Stairs.

Problem:

You are climbing a staircase. It takes steps to reach the top.

Each time you can either climb or steps. In how many distinct ways can you climb to the top?

Example 1:

Input: n = 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: n = 3
Output: 3…