Dynamic Programming, Greedy Algorithms
Completed by Abdiel Saucedo
August 21, 2026
38 hours (approximately)
Abdiel Saucedo'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: Algorithms
- Category: Python Programming
- Category: Quantum computing
- Category: Data Structures
- Category: Theoretical Computer Science
- Category: Design Strategies
