This repository contains the implementation of a hash table using two different collision resolution strategies: Separate Chaining and Open Addressing.
In the Open Addressing method, all elements are stored in the hash table array itself. When a collision occurs, we look for the next available slot or address in the hash table.
In the Separate Chaining method, each element in the hash table array is a linked list. All elements that hash to the same index are placed in the same linked list.