Leetcode 70. Climbing Stairs (Python) Recursion with Memoization

preview_player
Показать описание
Leetcode 70. Climbing Stairs (Python)

In this video, I solve the Leetcode Climbing Stairs problem using recursion. Asked in Amazon 2021 panel interview.
You can find code on my (Ravina Gaikawad) GitHub repository. Find the link below.

If you have any algorithm problems you want me to solve please let me know in the comments below.

Ravina Gaikawad
Pseudocoder

#codinginterview #algorithm #leetcode #python #programming #faang #dsa #youtubevideo #pseudocoder
Рекомендации по теме
Комментарии
Автор

def climbStairs(self, n: int) -> int:
if n == 1:
return 1
if n==2:
return 2
prev2 =1
prev1 = 2
for i in range(3, n+1):
current = prev1+prev2
prev2 = prev1
prev1 = current
return prev1

nikhilgupta
visit shbcf.ru