Problem $1(1$ pt$).$ This problem will give you an introduction to leetcode.com: LeetCode $-$ The World's Leading Online Programming Learning Platform

This is a good place to practice coding interview problems, which are at three levels: Easy, Medium, and Hard. To become proficient, you should be able to do the Easy problems, most of the Medium problems, and some of the Hard problems. There are over $2500$ problems, so it$$s impractical to try them all, but going through $200$ to $300$ is not unreasonable if done over time, e$.$g$.,$ a year. You can also do a search for web sites which list a reasonable selection of problems as a starter, e$.$g$.,60$ LeetCode problems to solve for coding interview $|$ by Kohei Arai $|$ Medium. Our alumni tell me that after the first $30$ to $50$ problems, it becomes easier and fun. So it$$s important to persist even though it may be frustrating at the beginning. By the way, there are a lot of resources to help you, e$.$g$.,$ NeetCode $-$ YouTube

In this problem, you will get experience with the Climbing Stairs problem: Climbing Stairs $-$ LeetCode

You are climbing a staircase. It takes n steps to reach the top.

Each time you can climb $1$ or $2$ steps. In how many distinct ways can you climb to the top?

Mathematically, there is a recursive solution:

climbStairs$(0)=0$

climbStairs$(1)=1$

for n $>1,$ climbStairs$($n$)=$ climbStairs$($n$-1)+$ climbStairs$($n$-2)$

$//$ Interestingly, this is the same as the Fibonacci number recursion.