Dynamic Programming, Greedy Algorithms
Completed by MOHAMMED YOUSEF MOHAMMED ALSHAMMARI MOHAMMED YOUSEF MOHAMMED ALSHAMMARI
November 18, 2025
38 hours (approximately)
MOHAMMED YOUSEF MOHAMMED ALSHAMMARI MOHAMMED YOUSEF MOHAMMED ALSHAMMARI'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: Theoretical Computer Science
- Category: Algorithms
- Category: Python Programming
- Category: Design Strategies
- Category: Quantum computing
- Category: Data Structures
