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