// Climbing Stairs — EASY
// Category: dynamic-programming
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?
Hint: This is the Fibonacci sequence — the number of ways to reach step n equals ways(n-1) + ways(n-2).
Example: n = 2
Output: 2