Learn everything you need to ace tough technical interviews. This Python course covers graph theory, dynamic programming, and linear programming. You'll learn niche algorithms and ways of thinking that will help you advance your career from a junior to a senior developer.

22 Hours

of material

null challenges

and quizzes

Certificate

of completion

A key part of the

back-end career path

Avoid tutorial hell

by writing a ton of code

Learn flexibly online

without interrupting your life

1

Dijkstra's

Learn about Dijkstra's algorithm, one of the best ways to find the shortest path between two points

2

Bellman Ford

Implement the Bellman Ford algorithm, a specialized way to find the shortest path on a weighted graph

3

Heaps

Master priority queues and heaps. You'll efficiently find the minimum or maximum element in a collection

4

A* Search

The A* algorithm is an advanced search that uses heuristics to guide the search to a more optimal solution

5

Dynamic Programming

Dynamic programming is all about trading space for time, learn how we can take exponential problems and make them linear

6

Edit Distance

Edit distance is a classic problem in computer science, learn how to solve it with dynamic programming

7

Linear Programming

Learn about how to solve complex optimization problems