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]

Every time I'm reminded how extremely poorly Kodak understand maths I just lose any respect I might have had for him.

Kodak, stick to programming, you seem to know a little bit of programming, but you keep getting schooled whenever it comes to math.