Скачать или смотреть Dynamic Programming 101: Leetcode 70. Climbing Stairs

Hey guys, welcome back to another leetcode video.
Today, we solve the easy leetcode problem 70. Climbing Stairs using Dynamic programming. In this video, I introduce two dynamic programming techniques: memoization and tabulation, and also give some guidelines you can follow to help you solve DP problems.

I hope you will enjoy it!

Leetcode playlist:    • Interview Question  
JavaScript playlist:    • JavaScript  

Sauce:
Leetcode problem: https://leetcode.com/problems/climbin...
Code: https://github.com/ComputerBread/leet...
Article about DP patterns: https://leetcode.com/discuss/general-...
but why?    • Dog Jumping Down Stairs  

To support me (if you feel like it): https://ko-fi.com/computerbread/
Cheatcheet/mindmap: https://ko-fi.com/s/34966c8fb1
Twitter:   / computerbread  
Subscribe:    / @computerbread  

Chapters:
00:00 Introduction
03:30 Dynamic Programming
03:48 Memoization
05:27 Tabulation
07:15 Guidelines


(for the algorithm)
Every software engineer, developer, programmer, computer science student looking for a high paying job, 6 figures, millionaire, should spend time to grind leetcode to ace technical interviews. If you want to be cracked, you need to crack leetcode!

Stack,

#javascript #leetcode #programming #dynamicprogramming