Learn Data Structures and Algorithms 2 in Python
Lane is a back-end engineer and the lead instructor of Boot.dev. He has taught over one million students worldwide.
boot.dev About this course
This Python course is not for the faint of heart. It covers graphs, dynamic programming, and linear programming among other things. Prerequisite Courses: Learn Data Structures and Algorithms in Python
What you'll learn
Dijkstra's
Learn about Dijkstra's algorithm, one of the best ways to find the shortest path between two points
Bellman-Ford
Implement the Bellman-Ford algorithm, a specialized way to find the shortest path on a weighted graph
Heaps
Master priority queues and heaps. You'll efficiently find the minimum or maximum element in a collection
A* Search
The A* algorithm is an advanced search that uses heuristics to guide the search to a more optimal solution
Dynamic Programming
Dynamic programming is all about trading space for time, learn how we can take exponential problems and make them linear
Edit Distance
Edit distance is a classic problem in computer science, learn how to solve it with dynamic programming
Linear Programming
Learn about how to solve complex optimization problems
