Consider a string, s, that is a series of characters, each followed by its frequency as an integer. the string is not compressed correctly, so there may be many occurrences of the same character. a properly compressed string will consist of one instance of each character in alphabetical order followed by the total count of that character within the string. for example, the string a3c9b2c1 has two instances where ‘c’ is followed by a count: once with 9 occurrences, and again with 1. it should be compressed to a3b2c10.