Easy · Dynamic programming

Climbing Stairs

You climb one or two steps at a time. How many different ways are there to reach step n?

n = 3

→ 3   (1+1+1, 1+2, 2+1)