Algorithms & Data Structures¶
The structures and techniques that decide whether your program runs in a millisecond or a minute. Each lecture connects the why to runnable code and a ladder of practice problems.
-
Hash Tables
Why average-case
O(1)lookups are possible, how collisions are handled, and when hashing betrays you.
More on the way
Trees & balancing, graph traversal, dynamic programming, and complexity
analysis are next. New lectures are added by the prof-helper agent and
appear here automatically.