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]

>>133
A function defined from a domain X to a range Y, is well defined if and only if for each x in X, there is a unique y in Y such that f(x) = y.