Climbing Stairs
Easy
Dynamic Programming
You are climbing a staircase with n steps. You can climb 1 or 2 steps at a time. Print the number of distinct ways to reach the top.
Constraints
1 <= n <= 45
Discussion
No discussions yet.
Shalyam Support
Hi! Ask us anything — we'll reply on WhatsApp or Telegram within 24 hours.