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