"raja" <ma************@gmail.com> writes:
Design and implement an efficient algorithm to remove consecutive
1char, 2char, 3 char... so on recurrences in dictionary words.
For example, "abbabccbc" first will become "ababcbc", then become
"abc". Similarly, "abcaab" will become "abcab" and but stays as it is
after that.
And why exactly would we want to do that?
This looks like a homework assignment. If so, try to solve the
problem yourself; if you run into trouble, show us what you have and
exactly what problems your having, and we might be able to give you
some hints.
Either that, or give us your instructor's e-mail address so we can
submit our solutions directly.
--
Keith Thompson (The_Other_Keith)
ks***@mib.org <http://www.ghoti.net/~kst>
San Diego Supercomputer Center <*> <http://users.sdsc.edu/~kst>
We must do something. This is something. Therefore, we must do this.