• CONTEST ALERT - Experience the power of DDR5 memory with Kingston Click for details

c program

Status
Not open for further replies.

saro_gn

Broken In
hai,
pls any one give the program.

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. You need to output only the last string ("abc" and "abcab" for the above two examples).

bye.,
saravana.
 

sakumar79

Technomancer
Use recursion until number of characters to be compared is more than half the length of the string...

Please dont ask others to write the program for you... Get the algorithm and work it out yourselves... That is the correct way to learn...

Arun
 
Status
Not open for further replies.
Top Bottom