07 - Optimization Problem (Dynamic Programming for Beginners)

[akashkumarsingh]

It is almost unbelievable how easily I was able to understand your explanations. Please keep making these amazing videos.

[Ubrmike]

The idea about "thinking about transition functions from the perspective of the problem being almost solved" really clicked with me. It also made sense that in the combinatoric problems why we take the sum, whereas in optimization we pick the optimal solution from all the possible optimal solutions to the sub problems that lead to our final solution! The lines that you drew from the "solution cell" to the previous steps that lead to the solution step made the connection very clear!

[koober_]

Currently thanking my lucky stars I found your channel linked on a random Leetcode post. I couldn't have dreamed of being able to solve this problem on my first try using DP a week ago. Something about your framework for DP just clicked, and for once I didn't have to start from the recursive soln -> memoization -> DP. It's a shame this content isn't anywhere near as widely known as it should be.

And happy new year! Looking forward to the new great content you'll put out :)

[crazycurlzXD]

You're amazing. DP has never seemed more understandable. I'll be sure to share your lectures with my friends. Thanks a lot!

[terasi]

I was struggling with a problem for days, tried various tutorials and understood none of them. Watched your videos and I was able to immediately solve it!!!

Your teaching and examples are amazing and on point! Thank you much!!!!

[syedrizwan]

these are the best videos on dp for beginners i've found on the internet so far. keep making more. <3

[sammyj]

What a beautiful explanation!! I could follow along and predict what you were going to do thanks to all the previous videos you have published. Can't wait to finish the series and take the DP problems (which I have always feared) head on!! Thanks Andrey!

[samrat_malisetti]

Very good playlist for Dynamic programming. Waiting for other videos :) Thank you for such great videos.

[manibhushankumarsingh]

00:05 Introduction to Optimization Problem in Dynamic Programming
00:54 Understanding optimization problems and applying dynamic programming
02:09 Dynamic Programming requires defining objective function and base cases.
03:17 Discussing the optimization problem approach in dynamic programming.
04:21 Dynamic programming solves optimization problems by finding the cheapest amount to pay.
05:34 Using bottom-up approach for dynamic programming
06:42 Dynamic Programming for Beginners
08:20 Time and space complexity analysis of the algorithm.

[nivethagovindan]

Hi Andrey!! Its super awesome...that u are allocating time for this apart from ur fte....there is very less resources available over the internet to learn DP as you mentioned in ur first videos are great...keep going!!!

[Karim-nqbe]

Thanks to you I've been climbing my way little by little to the top of DP like a caterpillar climbs a tree.

[eittorres]

Thank you for making these videos and sharing your knowledge.

[mehdi_ba]

Awesome video and explanation it helped me a lot!! (and, just a small thing i noticed, we say "a equals b" or "a is equal to b", that's just an advice ;) )

[__goyal__]

for people that have come having seen this problem on leetcode, the 'return' statement would be return min(dp[-1], dp[-2]) as you would be expected to climb one more step (as this was unintuitive)

[mihirsidhdhapurasensei]

your way of solving the question very pretty. i just love ur style to solve .)

[heisenbugg]

in the last iteration of for loop, we are trying to access p[n] while N is the size of p. Did I miss something or is that wrong?

[manjus]

Hi Andrey, thank you for this amazing, "easy to understand" series. Can you please make a similar series on Graph Theory, and some of the problems related to it, like airline connections, social network connections, etc.?

[alissabrave]

Thanks, but I still couldn't understand how it's cost 3 when we're in the 1st step.

[sushil]

Nice video :)
Btw, isnt dp[1] supposed to be p[0] rather than p[1]?
And shouldnt u add p[i-1] to the minimum of dp[i-1] and dp[i-2]?
(i.e) dp[i] = p[i-1] + min(dp[i-1], dp[i-2])
Correct me if im wrong

[motorsports]

what about k?(1 or 2 steps) That's not in the code