Careertail
About UsCoursesCareer PathsBlogOpportunities
Log In
Courses>Software Engineering>Learn Dynamic Programming Essentials
DevelopmentLearn Dynamic Programming Essentials
Price:Paid
Length:3.5 hours
Content type:video
level:all levels
Updated:20 February 2024
Published:21 August 2022
Similar courses
Opportunities
Courses>Software Engineering>Learn Dynamic Programming Essentials
Learn Dynamic Programming Essentials
3.1 (55.0)
3.5 hours
55 students
What you will learn
1Recursion, memoization
2Dynamic Programming - top down recursive approach and bottom up iterative approach
3Knapsack 0/1 and unbounded
4Rod Cutting problem
5Minimum number of coins for making change problem
6Maximum number of ways for making change coin problem
7Longest Common Subsequence
8Longest Common Substring
9Minimum number of insertion and deletions required to convert string A to string B
Target audiences
1Software developers, IT professionals, students who want to land tech jobs.
Requirements
1Some programming knowledge in any language such as C#, Java, C++, Python etc.
FAQ
You can view and review the lecture materials indefinitely, like an on-demand channel.
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!
Description

Recursion is one of the most important concept in coding questions and serves as the foundation for Dynamic Programming, basically Dynamic Programming is improved recursion or recursion with memoization. If you don't understand the fundamental logic of solving DP problems then you will always be afraid of facing coding questions in any interview since these questions can be asked during any tech jobs interview.

Apart from teaching fundamental logic for solving DP problems in this course I am also teaching you some of the basic problems in DP and how other problems can be solved easily by deriving the solution from basic DP problems.

The best way to learn this course is to follow the course structure as it is and not skip or jump lectures. This is a fun course and by the end of this course you would have better understanding of what dynamic programming is and how to solve them.

The questions included are -

- Recursion

- Memoization

- Dynamic Programming - top down approach and bottom up approach

- Knapsack - top down recursive solution both without and with memoization

- Knapsack -bottom up Dynamic Programming iterative solution

- Rod Cutting problem

- Minimum number of coins for making change problem

- Maximum number of ways for making change coin problem

- Longest Common Subsequence - top down recursive solution both without and with memoization

- Longest Common Subsequence - bottom up Dynamic Programming iterative solution

- Longest Common Substring

- Minimum number of insertion and deletions required to convert string A to string B.   

Similar courses
Opportunities
Make the most out of your online education
Careertail
Copyright © 2021 Careertail.
All rights reserved
Quick Links
Get StartedLog InAbout UsCourses
Company
BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions
Stay up to date
Trustpilot
Careertail
Courses>Software Engineering>Learn Dynamic Programming Essentials
DevelopmentLearn Dynamic Programming Essentials
Price:Paid
Length:3.5 hours
Content type:video
level:all levels
Updated:20 February 2024
Published:21 August 2022
Similar courses
Opportunities
Courses>Software Engineering>Learn Dynamic Programming Essentials
Learn Dynamic Programming Essentials
3.1 (55.0)
3.5 hours
55 students
What you will learn
1Recursion, memoization
2Dynamic Programming - top down recursive approach and bottom up iterative approach
3Knapsack 0/1 and unbounded
4Rod Cutting problem
5Minimum number of coins for making change problem
6Maximum number of ways for making change coin problem
7Longest Common Subsequence
8Longest Common Substring
9Minimum number of insertion and deletions required to convert string A to string B
Target audiences
1Software developers, IT professionals, students who want to land tech jobs.
Requirements
1Some programming knowledge in any language such as C#, Java, C++, Python etc.
FAQ
You can view and review the lecture materials indefinitely, like an on-demand channel.
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!
Description

Recursion is one of the most important concept in coding questions and serves as the foundation for Dynamic Programming, basically Dynamic Programming is improved recursion or recursion with memoization. If you don't understand the fundamental logic of solving DP problems then you will always be afraid of facing coding questions in any interview since these questions can be asked during any tech jobs interview.

Apart from teaching fundamental logic for solving DP problems in this course I am also teaching you some of the basic problems in DP and how other problems can be solved easily by deriving the solution from basic DP problems.

The best way to learn this course is to follow the course structure as it is and not skip or jump lectures. This is a fun course and by the end of this course you would have better understanding of what dynamic programming is and how to solve them.

The questions included are -

- Recursion

- Memoization

- Dynamic Programming - top down approach and bottom up approach

- Knapsack - top down recursive solution both without and with memoization

- Knapsack -bottom up Dynamic Programming iterative solution

- Rod Cutting problem

- Minimum number of coins for making change problem

- Maximum number of ways for making change coin problem

- Longest Common Subsequence - top down recursive solution both without and with memoization

- Longest Common Subsequence - bottom up Dynamic Programming iterative solution

- Longest Common Substring

- Minimum number of insertion and deletions required to convert string A to string B.   

Similar courses
Opportunities
Make the most out of your online education
Careertail
Copyright © 2021 Careertail.
All rights reserved
Quick Links
Get StartedLog InAbout UsCourses
Company
BlogContactsPrivacy PolicyCookie PolicyTerms and Conditions
Stay up to date
Trustpilot