Top 5 Dynamic Programming Patterns for Coding Interviews - For Beginners

0:00 - Intro
1:11 - 1. Fibonacci Numbers
6:45 - 2. Zero One Knapsack
13:07 - 3. Unbounded Knapsack
16:51 - 4. Longest Common Subsequence
23:30 - 5. Palindromes

#dynamic #programming #python
Disclosure: Some of the links above may be affiliate links, from which I may earn a small commission.

[fightmeonclubpenguin]

This channel is such a great find. I just wish there were more videos haha

[tabeebyeamin]

These are good and makes me realize what a great CS curriculum I had that covered all 5 of these lol. I would also study
6. DFS + memoization (Longest Increasing Path in a Matrix, Path Sum III)
7. Backtracking + memoization (Regex/Wildcard, Partition to K Equal Sum Subsets)
8. State Machine (Best Time to Buy & Sell Stock variations)

[davidespinosa]

DP = recursion + memoization. Then, if you want to memoize using an array instead of a hash map, you can optimize that after. So it's no harder than recursion. But DP often uses a variable number of subproblems, while more straightforward recursions use only one or two subproblems.

[ranitchatterjee]

I want to thank Neetcode. The videos were great resource to learn coding and crack tech interviews. I'm very thankful to this channel. Hope your channel grows more and more. ❤️

[susmi]

This is truly life saving! Please make more of this type of videos for other topics. <3

[imjnny]

Thank you! This is so helpful! I look forward to more of this type pf high level overview :)

[alexeysubbota]

Guy, you really helped me a lot! After watching Climbing Stairs video I did solve Maximum Alternating Subsequence Sum problem not only using DP but using bottom up approach!

[homi.mp]

Brilliant explanation, your videos are extremely helpful, thank you for doing all the good work :)

[varunrajput]

This is perfect. Thank you.

Can you please make similar lists for other topics as well? That will be extremely helpful because while solving the problem it's good to have an idea about general approach you'll be following..

[dinhnhobao]

Great stuff! I have learned a lot from your videos. Please do more of these!

[jinny]

I'm not confident with dp problems. But this spreadsheet is awesome!! Thank you as always. And congrats you've gained 10k subscribers so far :) You deserve more.

[miettoisdev]

some real quality content here.
interview material is usually bloated with edgy-cleverish stuff, not structured according to problem's domain of knowledge and not prioritized correctly.

you, sir, have managed to sort all that out.

thank 🤜🤛

[whileminseok]

this is so AWESOME!!! thanks for sharing your knowledge :)

[panggrayta]

very clear explanation. good job NeetCode. keep up to date your videos . thanks

[kirillzlobin]

This style of videos is very informative. It helps to structure and categorize the information related to DP problems and allows to come to the solution faster.

[janailtongoncalvesdesouza]

The way you explain CS is awesome, bro! Keep doing the good job!

[venkatasriharsha]

The best Python Leetcode problem solver. Love u brother ❤️

[kartikhakim]

Please make and share more videos / spreadsheets like this
They are really helpful for practice 🙏

[max]

Easily the best LC channel, thank you :)

[karthik]

Your videos are really helpful. Just a suggestion, it would be really nice if you could create a video on when we should do backtracking vs dynamic programming. As some seems to fall on both with different runtime and people use different solutions