Dynamic Programming, Greedy Algorithms
Completed by Milan Cheeks
August 13, 2026
38 hours (approximately)
Milan Cheeks's account is verified. Coursera certifies their successful completion of Dynamic Programming, Greedy Algorithms
What you will learn
Describe basic algorithm design techniques
Create divide and conquer, dynamic programming, and greedy algorithms
Understand intractable problems, P vs NP and the use of integer programming solvers to tackle some of these problems
Skills you will gain
- Category: Design Strategies
- Category: Computational Thinking
- Category: Data Structures
- Category: Theoretical Computer Science
- Category: Analysis
- Category: Python Programming
- Category: Algorithms
- Category: Quantum computing
- Category: Applied Mathematics
