Climbing Stairs
๐ง Problem
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?
๐ท๏ธ Tags
Math,Dynamic Programming,Memoization
๐ Difficulty
Easy
โ
Success Rate: 51%
๐ฅ Submissions: 2,952,667
๐ Accepted: 1,504,735
โค๏ธ Reactions
๐ Likes: 11310
๐ Dislikes: 350
๐ก Hints
To reach nth step, what could have been your previous steps? (Think about the step sizes)
๐ Similar Questions
- Min Cost Climbing Stairs
- Fibonacci Number
- N-th Tribonacci Number