Advanced Dynamic Programming

Published 4/2024
MP4 | Video: h264, 1280×720 | Audio: AAC, 44.1 KHz, 2 Ch
Language: English | Duration: 38m | Size: 239 MB

Learn how to solve any DP problem

What you’ll learn
Deal with intresting and hard-to-solve exercises
Develop problem solving mindset
Solve real-life problems
Learn some good practices
Define the correct sub-problems
Develop python coding skills

Requirements
Familiar with dynamic programming
Python basics

Description
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 path which minimizes / maximizes a value

discover a subset that minimizes / maximizes a value

I hope you enjoy this course!

Who this course is for
Computer Science Students
Software Developers

HomePage