Skip to main content

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

  1. Complexity and Big-O
  2. Arrays, linked lists, stacks and queues
  3. Hashing
  4. Trees and heaps
  5. Sorting and searching
  6. Graphs and traversal
  7. Shortest paths and spanning trees
  8. Dynamic programming
  9. Greedy and divide-and-conquer methods
  10. 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.

Back to top