tags::
type:: Leetcode_Solution
in:: Algorithms MOC

Leetcode 70 - Climbing Stairs

• its fib
• make a dp array and fill initial conditions, then stop when you reach index n and return the value

Dynamic Programming