Q: Implement a method to perform basic string compression using the counts of repeated characters. For example, the string aabcccccaaa would become a2b1c5a3. If the "compressed" string would not becomes smaller than the original string, your method should return the original string.
Read full article from codebytes: Implementing Basic String Compression using the counts of repeated characters [Coding Question][Java]
