Data Structures & Algorithms IV: Pattern Matching, Dijkstra’s, MST, and Dynamic Programming Algorithms
Enroll now →
About this course
Delve into Pattern Matching algorithms from KMP to Rabin-Karp. Tackle essential algorithms that traverse the graph data structure like Dijkstra’s Shortest Path. Study algorithms that construct a Minimum Spanning Tree (MST) from a graph. Explore Dynamic Programming algorithms. Use the course visualization tool to understand the algorithms and their performance.
What you'll learn
- understand and implement pattern matching algorithms like KMP and Rabin-Karp
- apply Dijkstra's algorithm for shortest path problems
- construct Minimum Spanning Trees using relevant algorithms
- develop solutions using dynamic programming techniques
Skills you'll gain
Related courses
Data Science Foundations
USD 49
Machine Learning for Trading
USD 49
DataPrep for H2O Driverless AI
USD 49
Internet of Things and AI Cloud
USD 49
The Complete Quantum Computing Course
USD 199.99
Statistical Learning for Data Science
USD 49
Cloud Machine Learning Engineering and MLOps
USD 49
Applied Natural Language Processing in Engineering Part 2
USD 49
Course details are provided by the platform and may change — always confirm on the provider's site. Links may be affiliate links.