If one has to sum up why we need hash tables, it would be “Θ(1) look up time complexity”. In other words, the time complexity of lookup (and insertion, along with deletion) with a hash table is constant time, it has nothing to do with the number of items in the container!
This seems magical, right? Well, it also sounds too good to be true.