Dynamic Programming, Greedy Algorithms
Completed by Anton Kostserau
December 10, 2025
38 hours (approximately)
Anton Kostserau'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: Analysis
- Category: Theoretical Computer Science
- Category: Quantum computing
- Category: Design Strategies
- Category: Applied Mathematics
- Category: Computational Thinking
- Category: Data Structures
- Category: Algorithms
- Category: Python Programming
