Algorithms

Learn to reason about what a program costs before you run it. The course starts with sorting, searching and Big-O notation, then works up through recursion, backtracking, dynamic programming, greedy methods and graph theory. Each topic is taught by writing the algorithm yourself and then breaking it, so you understand where it fails and why the standard library implementation looks the way it does. This is the course that makes technical interviews tractable, and the one that separates people who can write code from people who can tell whether that code will hold up under load.