- Theoretical Computer Science
- Graph Theory
- Algorithms
- Data Structures
- Computational Thinking
- Bioinformatics
Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Egor Evgen'evich Petrov
September 12, 2020
14 hours (approximately)
Egor Evgen'evich Petrov's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Skills you will gain

