String Compression using count of repeated characters - Run Length Encoding

Objective: Write an algorithm to compress the given string by using the count of repeated characters and if new compressed string length is not smaller than the original string then return the original string.

Example:

Input String : ssssuuuummmmmmiiiittttttttttttt
Compressed String : s4u4m6i4t13

Input String : Jaain
Compressed String : Jaain (Since compressed string is length is greater than original string)

Input: A String

Output: either A compressed string or original string whichever us smaller.

Approach:

• Create a StringBuffer sb, int count
• Navigate the string taking each character at a time.
• If you find the same characters increase the count.
• if not then append the character and its count to the string buffer sb.
• reset the count value.
• Compare the length of the compressed String and the original and whichever is the smaller return that string.
  

Run This Code

Code:

Compression of ssssuuuummmmmmiiiittttttttttttt is : s4u4m6i4t13
Compression of Jaain is : Jaain

Also Read:

- Find Lexicographically smallest or largest substring of size k Beginner
- Minimum Deletions to make the occurrence of each character unique. Hard
- Remove Duplicates from a string Medium
- Find All the Well Ordered Permutations of a Given String. Medium
- Convert Postfix to Infix Expression Medium
- Convert Postfix to Prefix Expression Medium
- Generate all the strings of length n from 0 to k-1. Medium
- Compare two version numbers of a software Medium