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?
00:00 Intro to the task
00:27 Solving the problem
02:37 Initial solution. Additional polishing.
05:02 Checking and submitting the solution
Download
0 formats
No download links available.
LeetCode. 70. Climbing Stairs. Coding in Swift. | NatokHD