Notes by Lex Toumbourou

Separate chaining is a collision resolution technique used in a Hash Table where each slot contains a linked list of elements that hash to that position. When a collision occurs (two keys hash to the same slot), the new element is simply added to the linked list at that position. This approach allows the hash table to handle an unlimited number of elements.