Simple and Clear Dynamic Programming Tutorial through Leetcode (121,122,123,188,309,714)

preview_player
Показать описание
Hi everyone. In this video, we will talk about 6 problems from Leetcode on Dynamic Programming. The problems we will solve together are 121, 122, 123, 188, 309 and 714 from Leetcode. Unfortunately, if you look at the solutions, most solutions don't mention how they formulate problems into DP. Worse, some solutions use greedy approach without justifying (i.e proving why greedy works). So I hope my video helps how you can set up dynamic programming (bottom - up) matrix and solve the problems !

I'll add time stamp here.

0:00 Explaining how to formulate the given problems into Dynamic Programming
17:58 The first problem - Leetcode 188
19:32 The second problem - Leetcode 123
21:07 The third problem - Leetcode 122
22:09 The fourth problem - Leetcode 121
22:55 The fifth problem - Leetcode 309
24:18 The last problem - Leetcode 714

#leetcode #dynamicprogramming #python #programming
Рекомендации по теме
visit shbcf.ru