A hash table uses a hash function to map keys to array indices. Collisions occur when multiple keys hash to the same index.
Chaining: Store colliding elements in linked lists.
Linear Probing: Find next empty slot sequentially.
Quadratic Probing: Use quadratic increments to find slots.