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