Greedy Algorithms, Minimum Spanning Trees, and Dynamic Programming
Completed by Roman Pustobaiev
June 17, 2025
14 hours (approximately)
Roman Pustobaiev'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: Graph Theory
- Category: Bioinformatics
- Category: Data Structures
- Category: Algorithms
