Algorithms Part I (Princeton)
Self-paced
Basic Java
Sedgewick’s gold-standard algorithms course. Covers searching, sorting, stacks, queues, and graphs at the depth most CS programs expect.
What you will learn:
- Big-O analysis and complexity classes
- Sorting algorithms (merge, quick, heap)
- Hash tables, BSTs, balanced trees
- Union-find and basic graph algorithms
Who it is for: CS students supplementing Data Structures, self-taught engineers prepping for FAANG interviews.
Honest take: Rigorous and dense. Pair with LeetCode — this gives theory, LeetCode gives reps.