💃 Dynamic Programming Climbing Stairs

In this post we are going to approach the leetcode problem Climbing Stairs.

Problem Description

tip

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?

The Fibonacci numbers are the sequence of numbers $\{F_n\}_{n=1}^\infty$ defined by the linear recurrence equation $F_n = F_{n-1} + F_{n-2}$ with $F_1 = F_2 = 1$, and conventionally defining $F_0 = 0$.

\[mean = \frac{\displaystyle\sum_{i=1}^{n} x_{i}}{n}\] \[\frac{1}{2} + \frac{1}{3}\] \[\forall x \in X, \quad \exists y \leq \epsilon\] \[\frac{1}{2} + \frac{1}{3} = \frac{3}{6} + \frac{2}{6} = \frac{5}{6}\]

$ \frac{3}{2} $