P05 · Algorithms and Data Structures for Data Science
A free, illustrated L2 course of 10 modules in the Programming and Data track. Modules include: Complexity and Big-O; Arrays, linked lists, stacks and queues; Hashing.
P05 L2 · Intermediate 10 modules · about 40 lessons Planned · Ring 3
Part of the Programming and Data track. Ships in Ring 3 (Breadth) of the roadmap.
Modules
- Complexity and Big-O
- Arrays, linked lists, stacks and queues
- Hashing
- Trees and heaps
- Sorting and searching
- Graphs and traversal
- Shortest paths and spanning trees
- Dynamic programming
- Greedy and divide-and-conquer methods
- Probabilistic structures: Bloom filters, HyperLogLog, locality-sensitive hashing
Signature illustrations
The pictures a learner should still see in their head a year later:
Step-by-step algorithm traces, growth-rate curves, recursion trees, dynamic-programming tables filling in, graph-traversal animations.
Status
This course is planned, not written yet. It ships with Ring 3 (Breadth).
Every lesson will follow the same twelve-part blueprint with at least three purpose-made figures. Watch the repository to hear when modules ship, or help write and review it.