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? Example: n = 3. Output: 3. The ways are: (1+1+1), (1+2), (2+1). Example: n = 5. Output: 8. Here's your DP starting point.
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
$ curl repovive.com/roadmaps/maang-interview-prep/dynamic-programming/problem-climbing-stairs
░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████████████████████████████████████████████████████████████████████████████