Find the perfect coding resourcesLearn how skillcraft.ai helps developers find the perfect coding learning resourcesLearn more→
Lane Wagner
Instructor
Lane is a back-end engineer and the lead instructor of Boot.dev. He has taught over one million students worldwide, on Boot.dev, FreeCodeCamp, YouTube and the Backend Banter podcast. Lane worked as a backend engineer writing Go, Python and TypeScript, then moved into engineering management and a couple of years later left to build Boot.dev full-time.
Completion
Certificate included
Format
Interactive coding
Freemium
Implement Dijkstra's shortest path algorithm
Apply the Bellman-Ford algorithm for weighted graphs
Master priority queues and heaps for efficient data retrieval
Utilize the A* search algorithm for optimal pathfinding
Employ dynamic programming techniques to optimize complex problems
You might know algorithms, but do you know advanced algorithms? We're not really sure what that means either, because the distinction is a bit arbitrary. In a nutshell, this is an extension of our basic algorithms course, and here you'll learn more niche algorithms and pick up new ways of thinking that will help you advance your career from a junior to a senior developer.
Learn about Dijkstra's algorithm, one of the best ways to find the shortest path between two points.
Implement the Bellman-Ford algorithm, a specialized way to find the shortest path on a weighted graph.
Master priority queues and heaps. You'll efficiently find the minimum or maximum element in a collection.
The A* algorithm is an advanced search that uses heuristics to guide the search to a more optimal solution.
Dynamic programming is all about trading space for time, learn how we can take exponential problems and make them linear.
Edit distance is a classic problem in computer science, learn how to solve it with dynamic programming.
Learn about how to solve complex optimization problems.
Share Your Experience
Sign in to leave a review and help others
No reviews yet. Be the first to review!