how about suffix tree?
On Thu, Aug 25, 2011 at 4:22 AM, Gaurav Menghani
wrote:
> Do you mean even O(1) isn't good?
>
> On Wed, Aug 24, 2011 at 8:43 PM, UMESH KUMAR
> wrote:
> > Qn. Remove all duplicates words from given a line without using extra
> memory
> > ?
> > Ex:-Hello word hello hi
> > Ou
Do you mean even O(1) isn't good?
On Wed, Aug 24, 2011 at 8:43 PM, UMESH KUMAR wrote:
> Qn. Remove all duplicates words from given a line without using extra memory
> ?
> Ex:-Hello word hello hi
> Out put:- Hello word hi
>
> --
> You received this message because you are subscribed to the Google
how about using a trie tree??
--
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 opt
Both of these methods will require extra ,memory
On Wed, Aug 24, 2011 at 9:42 PM, Anup Ghatage wrote:
> 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
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 matc
use hashing
On Wed, Aug 24, 2011 at 8:43 PM, UMESH KUMAR wrote:
> Qn. Remove all duplicates words from given a line without using extra
> memory ?
>
> Ex:-Hello word hello hi
> Out put:- Hello word hi
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm
