# 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