Advanced Dynamic Programming

Focused View

Dimitris Bekiaris

38:33

375 View

1. Introduction

1. Welcome.mp4

01:52

2. Good practices and methodology

1. Good practices.mp4

03:28

2. Methodology to solve any DP problem!.mp4

04:11

3.1 example.zip

3. Example.mp4

05:03

3. Frogs like to jump

1. Exercise.html

2.1 frogs like to jump.zip

2. Solution.mp4

02:31

4. Gold hunting

1. Exercise.html

2.1 gold hunting.zip

2. Solution.mp4

02:20

5. Save your life points

1. Exercise.html

2.1 save your life points.zip

2. Solution.mp4

02:52

6. Waiting the bus

1. Exercise.html

2.1 waiting the bus.zip

2. Solution.mp4

03:31

7. Delivery boy

1. Exercise.html

2.1 delivery boy.zip

2. Solution.mp4

03:07

8. Final exercise

1. Exercise.html

2.1 final exercise.zip

2. Solution.mp4

05:02

9. Conclusion

1.1 a bit more methodology.zip

1.2 The yield keyword.html

1. A bit more methodology.mp4

03:29

2. Bonus Lecture.mp4

01:07

Description

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

Who is this for?

Computer Science Students

Software Developers

What You Need to Know?

Familiar with dynamic programming

Python basics

More details

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

User Reviews

Rating

average 0

Total votes0

Focused display

Programming Fundamentals

Dimitris Bekiaris

Instructor's Courses

Hello there!I am a .Net Developer with experience in CRUD applications.My passion is algorithms, especially dynamic programming, and data structures. I think every developer should learn how to implement different type of algorithms to solve different kind of problems.I am also a self-taught Android Developer. When a thought like "Hmm it would be nice if this app existed" comes, I get triggered and I want to start creating it.I am here to share with you as much knowledge as I have and make you the best developers out there!

Udemy

View courses Udemy

Students take courses primarily to improve job-related skills.Some courses generate credit toward technical certification. Udemy has made a special effort to attract corporate trainers seeking to create coursework for employees of their company.