in a string... yes, because there are only 256 possible characters (or 65536, in case of unicode), so just create a boolean array of length 256 initialized to false and whenever a character occurs make the corresponding element true. While scanning the string, if an element has already appeared, delete it.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
