Advanced Dynamic Programming

Dynamic programming is by far a very useful technique, but sometimes it can be difficult to be implemented correctly.

In this course I’m going to show you the methodology that I use, to solve easily any DP problem!

You are going to deal with some hard-to-solve exercises. So this is not a course for beginners, but for those who are more familiar with dynamic programming.

Take your time in every exercise, there is no reason to hurry up.

You should know that all these exercises are created by myself. I tried to cover many fields (included cases from real-life problems).

All solutions are implemented in Python. I think it’s one of the easiest programming languages to implement DP algorithms and deal easily with data structures (1D-Lists, 2D-Lists, Tuples etc).

Of course you can implement DP algorithms in any programming language of wide use.

There is no reason to skip an exercise, if you think it’s difficult enough for you. Probably the next one will be harder.

The concepts that we will cover are:

• find the minimum / maximum value

• find the best pathwhich minimizes / maximizes a value

• discover a subsetthat minimizes / maximizes a value

I hope you enjoy this course!

Rating Distribution

• 1 stars: 0 votes
• 2 stars: 0 votes
• 3 stars: 0 votes
• 4 stars: 0 votes
• 5 stars: 0 votes

Frequently Asked Questions

How long do I have access to the course materials?

You can view and review the lecture materials indefinitely, like an on-demand channel.

Can I take my courses with me wherever I go?

Definitely! If you have an internet connection, courses on Udemy are available on any device at any time. If you don’t have an internet connection, some instructors also let their students download course lectures. That’s up to the instructor though, so make sure you get on their good side!