Yes you are indeed right about the explanation I provided wasnt enough now that I go through it. Lets say the word I am currently checking is orange
so in this case, removing o will still result in range which is a valid word then removing e from the resulting word would still result in valid word rang. So basically I need to take out one letter at a time in such a manner that it results in valid word. I have the word list so I know the exact number of words and the words I am going go through. orange range rang ran an a I hope I was able to clarify this time around better Thanks in advance -S On Tue, May 18, 2010 at 4:59 AM, Jamie Fraser <[email protected]>wrote: > I think you need to explain your problem a bit better! :) > > On Thu, May 13, 2010 at 5:42 PM, S <[email protected]> wrote: > > Hello all, > > I have a list of words (about 1600) and all of them are > > reducible to some extent. So if I have this list, what would be the > > best way to put them in the list to compare as I reduce them. I > > thought of hash function but that just seem to be a optimal solution. > > Is there anyone who can give some inputs for the same ? > > > > I havent done any such programming and I am out of ideas > > so anything would be appreciated. > > > > > > Thanks in advance > > > > -S > > >
