- Python Programming
- Computer Science
- Theoretical Computer Science
- Algorithms
- Computational Thinking
- Programming Principles
- Analysis
- Pseudocode
- Data Structures
- Advanced Mathematics
- Design Strategies
Dynamic Programming, Greedy Algorithms
Completed by Abhigyan Singh Yadav
November 12, 2024
38 hours (approximately)
Abhigyan Singh Yadav'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
