MIT 6.006: Introduction to Algorithms
MIT's classic algorithms course, free online
MIT OpenCourseWare's legendary undergraduate algorithms course, taught by Erik Demaine, Jason Ku, and Justin Solomon. Covers data structures and dynamic arrays, sets, sorting and hashing, binary trees and AVL trees, binary heaps, breadth- and depth-first search, shortest paths (Bellman-Ford, Dijkstra), dynamic programming, and computational complexity. Full lecture videos, notes, quizzes, and problem sets are free.
Computer ScienceFreeintermediate14 weeks
Submitted by @yahianaimRoadmap (7 steps)
1
Algorithms & Data Structures
2 weeks#Algorithmic Thinking#Dynamic Arrays#Computational Models
2
Sets, Sorting & Hashing
2 weeks#Sorting Algorithms#Hash Tables#Linear Sorting
3
Trees & Heaps
2 weeks#Binary Trees#AVL Trees#Binary Heaps
4
Graph Search
2 weeks#Breadth-First Search#Depth-First Search#Graph Representations
5
Shortest Paths
2 weeks#Weighted Shortest Paths#Bellman-Ford#Dijkstra#All-Pairs Shortest Paths
6
Dynamic Programming
2 weeks#SRTBOT#LCS & LIS#Subset Sum#Pseudopolynomial Time
7
Complexity & Course Review
2 weeks#Computational Complexity#NP-Completeness Intro#Next Steps