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