already discussed many times....try using bitmasks On Sat, Jul 23, 2011 at 1:26 PM, Akshata Sharma <akshatasharm...@gmail.com> wrote: > better than O(n^2).. > > On Sat, Jul 23, 2011 at 1:08 PM, Akshata Sharma <akshatasharm...@gmail.com> > wrote: >> >> Given a string *Str of ASCII characters, write the pseudo code to remove >> the duplicate elements present in them. For example, if the given string is >> "Potato", then, the output has to be "Pota". Additional constraint is, the >> algorithm has to be in-place( no extra data structures allowed) . Extend >> your algorithm to remove duplicates in the string which consisted of UNICODE >> characters. >> > > -- > 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. >
-- 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.