Dynamic Programming lecture #2 - Coin change, double counting

preview_player
Показать описание
This is the second of several lectures about Dynamic Programming. I will again go through three problems: Combination Sum, Coin Change (min) and Coin Change (count). The third one is hardest because of double counting. Links to Leetcode in the pinned comment. Watch this lecture if you practice for competitive programming or for coding interviews. Consider turning captions on and setting the speed to x1.25.

Please give me suggestions about the format of a lecture or about topics for future lectures.

I’m Kamil Dębowski, better known as Errichto. I compete in and organize programming competitions. I make educational streams on Youtube and Twitch. I'm a finalist of ACM-ICPC, Topcoder Open, Facebook Hacker Cup and Google Code Jam. I got a second place in Google Code Jam 2018. I am/was nutella in Codeforces and target in Topcoder.

Watch me if you want to practice for coding interviews, competitive programming or just algorithms in general. I share my thought process, explain everything, and mention similar problems and techniques/algorithms.
Рекомендации по теме
Комментарии
Автор

he seems like the most wholesome .Like the people in anime who are not aware how good they are

progamerzzz
Автор

I went over this video 10-12 times for the last 2 days to understand the `why does it work` part rather than `how to solve` and finally I think I understand. Probably nobody else on youtube explains the small details which you do. Thanks for sharing your knowledge Kamil, really appreciate it.

SuperSamyu
Автор

"Avoid double counting"
"Avoid double counting"
I double counted the phrase so I guess I have to rewatch

enzodantas
Автор

You are an amazing teacher!!
I'm finally starting to understand DP

shivangitomar
Автор

your videos are so much helpful. please keep up the lectures on DP. liked it very much. Thanks a lot

alamintushar
Автор

Thanks much!! Please do complete all possible questions that you feel would be good in dp and all tricks that would help us in CP down the line!! Great job!! Thanks again @Errichto.

naughtyrishan
Автор

Great video! After these DP videos, do videos on graphs please.

Hetp
Автор

Joma Gave this channel a blow.. and I hope Erri will give some interesting content on it, help many aspiring coders...

piyushnaithani
Автор

Thank you so much!!! keep making these type of videos

lekdendorjia
Автор

Hey errichto i am cs student in india inspired by your great approach to problem solving!! looking forward to more in depth video on dp topics !!

mridul
Автор

last slide->
*Avoid double counting
*Avoid double counting

You madlad errichto!

wizardOfRobots
Автор

The coin change problem is what led to me to realize that I needed to learn dynamic programming. Thank you for going over this, your explanations are always crystal clear :D

fractal_lynn
Автор

Greate! Make a full series of covering different aspects of dp

svapnilsawant
Автор

hey errichto please complete the series by discusiing all the basic problems of dp.Just cover the basic 10 -15 problems

progamerzzz
Автор

Finally some great DP Series going one <3

RishabhDeepSingh
Автор

Thank you for all these videos plz make videos on combinatorics, number theory, game theory, geometry etc as these topics aren't covered anywhere

prajwalchoudhary
Автор

Best Thank You very Keep making videos.

lovvyparhar
Автор

best video ever for learning DP! thanks bro!

rahulbhatia
Автор

I love your videos and way you explain. I aspire to be like you at coding!

pranav
Автор

perfect explanation of coin change and double counting

chatrughanprasad