The underlying hashing algorithm hashes each character of the key, I understand this to be O(n) where n is the length of the key.
How can a hash table be considered O
