Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Dzmitry Sazanovich
April 1, 2026
14 hours (approximately)
Dzmitry Sazanovich's account is verified. Coursera certifies their successful completion of Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Skills you will gain
- Category: Computational Thinking
- Category: Algorithms
- Category: Graph Theory
- Category: Bioinformatics
- Category: Data Structures
