Jamani JF nomba msaada kwa anyejua programming in c++. kuandika c++ code ambayo itatafuta all repated subsequence in a string once is found the subsequence will be replaced by zero,length of subsequence and number of times it has repeated.
for example the input string can be abcfgabcdkabcmhabc here the abc has repeated so the output will be abcfg031dk032mh034 that means every subsequence that has repeated has been replaced.
Any one has ideas
for example the input string can be abcfgabcdkabcmhabc here the abc has repeated so the output will be abcfg031dk032mh034 that means every subsequence that has repeated has been replaced.
Any one has ideas