Hash table

Is it ever possible to have a Hash table that can do get,put,remove @ O(1) for Strings?

calculating the hash for the String alone is O(n), is it not? [that's if you want to produce a good hash that won't collide all over the place]

>>42
It would only work if the mappings are one to one. However, for like the 8th time, the mappings aren't always one to one. The fact that you think they are just indicates to me that you've never actually written any kind of code in your entire life.