How about this, We compare the first character with every character except the characters in the word itself, if there is a hit, it might be a word which is a duplicate. So from there on, compare each of the following characters till there is a white space or new line character. If there is no match, skip all the next characters and start with the next word's first character, but search only from that index to n. if there is a complete match, shift all the characters following the duplicate to the duplicates position.
Finding the same first characters: O(n) Finding if they are duplicates: O(n) -- 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.
