EdX
Georgia Institute of Technology,GTx
Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms (edX)
Dive deep into advanced algorithms with this specialized course on edX. From pattern matching to graph theory, learn essential techniques like KMP, Rabin-Karp, Dijkstra’s Shortest Path, Minimum Spanning Tree (MST) construction, and Dynamic Programming. Enhance your problem-solving skills with practical examples and visualizations.