Using linked lists (separate chaining)

Each of the array elements could be a reference to a linked list. Then when a collision occurs you can simply append the duplicate item onto the linked list.
A small hash table though will generate very long linked lists and your efficiency will start to approach O(n) for deletion and insertion due to time being dominated by the processing of the linked lists.

Each of the array elements could be a reference to a linked list. Then when a collision occurs you can simply append the duplicate item onto the linked list.