A hash table is an implementation of a key to value mapping.
Insertion
To insert a new key-value pair, first the key must be hashed into a number between and the max length of the internal storage array.
The value is then placed at internal_array[hashed_key_value].
This is an operation.
If a key already exists there are two ways of resolving collisions:
Reading
To read a key-value pair, first the key must be hashed into a number between and the max length of the internal storage array (in the same way it was inserted.
It then outputs the data at internal_array[hashed_key_value].
This is an operation.
Deletion
To delete a key-value pair, first the key must be hashed into a number between and the max length of the internal storage array (in the same way it was inserted.
It then overwrites the data at internal_array[hashed_key_value] to be null or None or whatever the semantic description of empty is in that language.
This is an operation.