Implement a method to perform basic string compression using the counts of
repeated characters.(inplace)
eg:- input: "aaabbbbbcdef"
output:"3a5b1c1d1e1f".
what should be my approach to this problem
if i calculate the size of array required to store the output string
and start from the last of the array then i wldn't get the right answer of
above input case.
and if start from front then i wldn't get the right answer of this input
case
eg:- input: "abcdef"
output: "1a1b1c1d1e1f"
--
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 options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
