Climbing Stairs
๐ง Problem
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?
๐ท๏ธ Tags
Math,Dynamic Programming,Memoization
๐ Difficulty
Easy
โ
Success ...
releetcode.hashnode.dev1 min read