C in 100 Seconds: Hash Table — Chaining, Insert, Lookup, Delete | Episode 49

Solve hash collisions with chaining. Each bucket holds a linked list. Insert prepends, lookup walks the chain, delete rewires and frees. A complete hash map in C. Student code: https://github.com/GoCelesteAI/c-in-100-seconds/tree/main/episode49 #c #programming #100seconds #learnc #hashtable #chaining #hashmap #datastructures #tutorial