70. Climbing Stairs
Easy53.9% acceptance4,945,542 / 9,173,084 submissions
Asked by 38 companies
Topics
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?
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 Explanation: There are three ways to climb to the top. 1. 1 step + 1 step + 1 step 2. 1 step + 2 steps 3. 2 steps + 1 step
Constraints:
1 <= n <= 45
Hints
Hint 1
To reach nth step, what could have been your previous steps? (Think about the step sizes)
Similar Questions
Min Cost Climbing StairsEasyFibonacci NumberEasyN-th Tribonacci NumberEasyMinimum Rounds to Complete All TasksMediumCount Number of Ways to Place HousesMediumNumber of Ways to Reach a Position After Exactly k StepsMediumCount Ways To Build Good StringsMediumFrog Jump IIMediumFind Number of Ways to Reach the K-th StairHardThe Number of Ways to Make the SumMedium