Dynamic programming_1

Dynamic programming, available at $79.99, has an average rating of 4.42, with 55 lectures, 21 quizzes, based on 322 reviews, and has 4893 subscribers.

You will learn about Importance of dynamic programming How to use the top-down approach of dynamic programming (memoization) How to use the bottom-up approach of dynamic programming (tabulation) How to solve almost any dynamic programming problem This course is ideal for individuals who are Computer science students or Software engineering students or Programmers or Competitive programmers It is particularly useful for Computer science students or Software engineering students or Programmers or Competitive programmers.

Enroll now: Dynamic programming

Summary

Title: Dynamic programming

Price: $79.99

Average Rating: 4.42

Number of Lectures: 55

Number of Quizzes: 21

Number of Published Lectures: 49

Number of Published Quizzes: 20

Number of Curriculum Items: 76

Number of Published Curriculum Objects: 69

Original Price: $19.99

Quality Status: approved

Status: Live

What You Will Learn

Importance of dynamic programming

How to use the top-down approach of dynamic programming (memoization)

How to use the bottom-up approach of dynamic programming (tabulation)

How to solve almost any dynamic programming problem

Who Should Attend

Computer science students

Software engineering students

Programmers

Competitive programmers

Target Audiences

Computer science students

Software engineering students

Programmers

Competitive programmers

Dynamic programming is one of the most important and powerful algorithmic techniques that can be used to solve a lot of computational problems, it’s a fundamental technique to learn to strengthen your algorithms and problem solving skills

But, a lot of students find hard times understanding dynamic programming and being able to apply it to solve problems, if you are in this situation, this course is made for you!

Why you should take this course:

Covers all what you need to know to start using dynamic programming to solve problems (introduction, recursion, how to recognize a dynamic programming problem, memoization, tabulation)

Shows you a technique to solve almost any dynamic programming problem

Has an active instructor that is ready to answer to your questions and doubts in case you don’t understand something

Explains the time and space complexity analysis of each solved problem

Includes 20 different interesting dynamic programming problems to practice on with the ability to test your Python solution on different test cases before watching the solution

Practice problems are:

1. Paths in matrix

2. House robber

3. Longest common subsequence

4. Gold mine

5. Edit distance

6. Ways to climb

7. Shortest common supersequence

8. Coin change

9. 0-1 Knapsack

10. Subset sum

11. Longest increasing subsequence

12. Ways to decode

13. Rod cutting

14. Interleaving string

15. Square matrix of ones

16. Partition problem

17. Sorted vowel strings

18. Minimum cost for tickets

19. Word break

20. Matrix chain multiplication

If you have any other question concerning this course that you want to ask before enrolling, you can send me a message on Instagram at @inside.code

Enjoy!

Course Curriculum

Chapter 1: Introduction

Lecture 1: What is dynamic programming

Lecture 2: Reminder on recursion

Chapter 2: Top-down approach (memoization) and bottom-up approach (tabulation)

Lecture 1: Top-down approach (memoization)

Lecture 2: Bottom-up approach (tabulation)

Lecture 3: Top-down vs Bottom-up

Chapter 3: How to solve almost any dynamic programming problem

Lecture 1: Directed acyclic graphs in dynamic programming

Chapter 4: Full example: minimum cost path

Lecture 1: Minimum cost path problem

Lecture 2: How to solve almost any dynamic programming problem

Lecture 3: Minimum cost path problem (code)

Chapter 5: Practice: Paths in matrix problem

Lecture 1: Paths in matrix (solution)

Lecture 2: Paths in matrix (code)

Chapter 6: Practice: House robber problem

Lecture 1: House robber (solution)

Lecture 2: House robber (code)

Chapter 7: Practice: Longest common subsequence problem

Lecture 1: Longest common subsequence (solution)

Lecture 2: Longest common subsequence (code)

Chapter 8: Practice: Gold mine problem

Lecture 1: Gold mine (solution)

Lecture 2: Gold mine (code)

Chapter 9: Practice: Edit distance problem

Lecture 1: Edit distance (solution)

Lecture 2: Edit distance (code)

Chapter 10: Practice: Ways to climb problem

Lecture 1: Ways to climb (solution)

Lecture 2: Ways to climb (code)

Chapter 11: Practice: Shortest common supersequence problem

Lecture 1: Shortest common supersequence (solution)

Lecture 2: Shortest common supersequence (code)

Chapter 12: Practice: Coin change problem

Lecture 1: Coin change (solution)

Lecture 2: Coin change (code)

Chapter 13: Practice: 0-1 knapsack problem

Lecture 1: 0-1 knapsack (solution)

Lecture 2: 0-1 knapsack (code)

Chapter 14: Practice: Subset sum problem

Lecture 1: Subset sum (solution)

Lecture 2: Subset sum (code)

Chapter 15: Practice: Longest increasing subsequence problem

Lecture 1: Longest increasing subsequence (solution)

Lecture 2: Longest increasing subsequence (code)

Chapter 16: Practice: Ways to decode problem

Lecture 1: Ways to decode (solution)

Lecture 2: Ways to decode (code)

Chapter 17: Practice: Partition problem

Lecture 1: Partition (solution)

Lecture 2: Partition (code)

Chapter 18: Practice: Rod cutting problem

Lecture 1: Rod cutting (solution)

Lecture 2: Rod cutting (code)

Chapter 19: Practice: Square matrix of ones problem

Lecture 1: Square matrix of ones (solution)

Lecture 2: Square matrix of ones (code)

Chapter 20: Practice: Minimum cost for tickets problem

Lecture 1: Minimum cost for tickets (solution)

Lecture 2: Minimum cost for tickets (code)

Chapter 21: Practice: Interleaving string problem

Lecture 1: Interleaving string (solution)

Lecture 2: Interleaving string (code)

Chapter 22: Practice: Sorted vowel strings problem

Lecture 1: Count sorted vowel strings (solution)

Lecture 2: Count sorted vowel strings (code)

Chapter 23: Practice: Word break problem

Lecture 1: Word break (solution)

Lecture 2: Word break (code)

Chapter 24: Practice: Matrix chain problem

Lecture 1: Matrix chain problem (solution)

Lecture 2: Matrix chain problem (code)

Instructors

Inside Code
Your algorithms and data structures content provider

Rating Distribution

1 stars: 7 votes

2 stars: 6 votes

3 stars: 13 votes

4 stars: 82 votes

5 stars: 214 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!