Hash table – what is the point of a hash table?

I have no experience with hash tables outside of arrays / dictionaries in dynamic languages, so I recently found that internally, they are implemented by using the hash of keys and use it to store the value What I don't understand is why I don't store the key (string, number, any) as the value of well key, rather than as its hash and storage

Solution

Why do we use a hashcode in a hashtable instead of an index?

Novel, you can check whether a key has been stored very quickly and quickly store a new mapping at the same time Otherwise, you must keep a sorted list of keys in order to store and retrieve mappings