Climbing Stairs — C# Coding Problem
Difficulty: easy | Category: dynamic-programming
Problem Description
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).
Examples
Example 1
Input: n = 2
Output: 2
Explanation: 1+1 or 2.
Example 2
Input: n = 3
Output: 3
Explanation: 1+1+1, 1+2, or 2+1.