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