Climbing Stairs Problem
Medium
DSA
Dynamic Programming
40 views
Problem Statement
Given n stairs find the number of distinct ways to climb to the top when you can climb 1 or 2 steps at a time using DP.
No official solution available.
Please login to submit solutions.