This course covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) and using linear/integer programming solvers for solving optimization problems. We will also cover some advanced topics in data structures.Read more.
This resource is offered by an affiliate partner. If you pay for training, we may earn a commission to support this site.
The techniques and tools covered in Dynamic Programming, Greedy Algorithms are most similar to the requirements found in Data Scientist job advertisements.
Dynamic Programming, Greedy Algorithms is a part of one structured learning path.
3 Courses
3 Months
Data Science Foundations: Data Structures and Algorithms
