LeetCode 70 Climbing Stairs - Problem Statement

Let me introduce you to LeetCode $70$, Climbing Stairs. You're climbing a staircase with $n$ steps. Each time you can climb $1$ or $2$ steps. How many distinct ways can you reach the top? Feel free to read the problem, think about it a little bit, and then move on to the next unit!

For $n = 4$: you can take $1+1+1+1$, $1+1+2$, $1+2+1$, $2+1+1$, or $2+2$ steps. That is $5$ distinct ways to reach the top.