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]

>>24
You seem awfully confused, there is no ambiguity here. Sets are unordered so the situation will never occur.

{1,2,3} is the same as {2,3,1}, and {2,3,1} is either a member of the set were talking about or not, so it's either true or false, never both.