Remove duplicate alphabets from a string and compress it in the same string. For example, MISSISSIPPI becomes MISP. O (n2) is not acceptable. For this problem is it a good idea to sort the array using a sorting technique with efficiency O(nlogn) and remove the duplicates?
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
