Algorithms, Part I
Princeton's algorithms course, free to audit, covering union find, sorting, priority queues, search trees and hash tables with real analysis and demanding programming assignments. A proper course rather than interview coaching.
Course
Interview Prep
Princeton University
6 weeks
Intermediate
Free
What it is
A university algorithms course taught by Robert Sedgewick and Kevin Wayne, free to audit, with lectures, a companion textbook and programming assignments that are graded automatically and are genuinely hard.
How it differs from interview preparation
Interview courses teach you to recognise and apply. This teaches you why an algorithm has the complexity it has and how to prove it, which is more than any interview requires and produces a much sturdier understanding. Candidates who have done this rarely have gaps in the fundamentals.
The assignments are the value
They are specified precisely and graded strictly on correctness, style and performance, which is the closest a free course gets to real feedback. Skipping them reduces this to a lecture series.
Best for: engineers who want the theory properly, and students who want a rigorous free algorithms course.
Ready to start?
Opens on Princeton University in a new tab.
Stuck on something specific?
Writing only gets you so far. If you want an answer to your situation rather than the general case, book a session and we will work through it together. Every session is free; a few slots open each week.
Follow along
New writing, resources and project ideas land here first.