A hash table maps keys to values by turning each key into an index using a hash function. Lookups, insertions and deletions are O(1) on average. When two keys produce the same index, it is a collision, handled by chaining or open addressing.
Example
hash('abc') % taille_du_tableau gives the slot where the key 'abc' is stored.