Climbing Stairs - Leetcode 70 - Dynamic Programming (Python)

Please check my playlists for free DSA problem solutions:

My Favorite Courses:

Data Structures & Algorithms:

Python:

Web Dev / Full Stack:

Cloud Development:

Game Development:

SQL & Data Science:

Machine Learning & AI:

[GregHogg]

Master Data Structures & Algorithms For FREE at AlgoMap.io!

[acfry]

this question cooked me, i ended up doing combinatorics (finding the number of ways to arrange 1’s and 2’s at each possible combination of 1 and 2) before i realized it was just fibonacci

[rjrjenem]

I took my algorithms class last semester and this is so good. Algorithms is the best part of CS in my opinion. Great video

[zhihangcheng]

This is the best tutorial that I saw, first time I clearly understand how different approach worked. (And how to convert between them)

[AKSHAT]

First video that helped my understand this intuitively. Thanks Greg! Kudos ❤

[hrushirajg]

Greg thank you so much, I couldn't find understanding dp so easily anywhere else

[julietruong]

Thank you for this alternate approaches and explaining each line out. Really helps my understanding!!

[Ambatakummmmm]

tysm. You're better than neetcode for sure.

[hyperboliq]

This is so good! I'm just starting to learn about DP and it's not as intimidating as reddit made it seem 😂😂

[meghachoudhary]

Please complete this DSA playlist first. VERY HELPFUL

[angiecarolcabreraherrera]

Great explanation, what app are you using for drawing ? thankss a lot !

[khoilucas]

Can you use the Binet formula? I know it is just approximate but at least it takes O(logn) time complexity

[aakashs]

Attended one interview, always I get problems I never come across or didn't study or cover it. One interview asked my leetcode Id, and then changed sample questions on the topics I didn't cover.

[clevo]

Solution 5. return int((((1+sqrt(5))/2)**(n+1) - ((1-sqrt(5))/2)**(n+1)) / sqrt(5))

[xingyuxiang]

I probably will not keep hitting the same hardware parts. I will not worry too much about operations research, either. I will use clear_cache().