MIT 6.006 Introduction to Algorithms
MIT's full undergraduate algorithms course from Spring 2020, free with lecture videos, notes, problem sets and exams with solutions, taught in Python by Erik Demaine, Jason Ku and Justin Solomon. It covers hashing, trees, heaps, graph search, shortest paths and dynamic programming with the reasoning behind each, which is what makes the knowledge transfer to new problems.
Course
Other
MIT OpenCourseWare
Intermediate
Free
MIT's full undergraduate algorithms course from Spring 2020, free with lecture videos, notes, problem sets and exams with solutions, taught in Python by Erik Demaine, Jason Ku and Justin Solomon. It covers hashing, trees, heaps, graph search, shortest paths and dynamic programming with the reasoning behind each, which is what makes the knowledge transfer to new problems.
Ready to start?
Opens on MIT OpenCourseWare 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. Sessions are free for approved Sefism members, and a few slots open each week.
Follow along
New writing, resources and project ideas land here first.