70. Climbing Stairs
Problem Statement
You are climbing a staircase. It takes n steps to reach the top.
Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?
Examples
Example 1
Input: n = 2
Output: 2
Explanation: There are two w...
outlierchronicles.hashnode.dev3 min read