String Compression Problem Statement

Ninja needs to perform basic string compression. For any character that repeats consecutively more than once, replace the repeated sequence with the character followed by the count of repetitions.

Input:

An integer 'T' representing the number of test cases. For each test case, a string 'S' indicating the input string to be compressed.

Output:

Output the compressed string for each test case on a new line.

Example:

If the string contains 'x' repeated 5 times, replace 'xxxxx' with 'x5'. Compression occurs only if the repeated count is greater than 1.

Constraints:

1 ≤ T ≤ 5

1 ≤ |S| ≤ 5000

Consecutive count of any character in the input is ≤ 9

Note:

There's no need for input or output operations, as these are already managed. Just implement the required function.

Question

String Compression Problem Statement

Ninja needs to perform basic string compression. For any character that repeats consecutively more than once, replace the repeated sequence with the character followed by the count of repetitions.

Input:

An integer 'T' representing the number of test cases.
For each test case, a string 'S' indicating the input string to be compressed.

Output:

Output the compressed string for each test case on a new line.

Example:

If the string contains 'x' repeated 5 times, replace 'xxxxx' with 'x5'.
Compression occurs only if the repeated count is greater than 1.

Constraints:

1 ≤ T ≤ 5
1 ≤ |S| ≤ 5000
Consecutive count of any character in the input is ≤ 9

Note:

There's no need for input or output operations, as these are already managed. Just implement the required function.

Accepted Answer

Implement a function to compress a string by replacing consecutive characters with the character followed by the count of repetitions.

Iterate through the input string and keep track of consecutive characters and their counts
Replace consecutive characters with the character followed by the count of repetitions if count is greater than 1
Return the compressed string

Accepted Answer

import java.util.LinkedHashMap; public class Main { public static void main(String[] args) { String s="iyyer"; String s1=""; char [] ch=s.toCharArray(); for(char i:ch){ System.out.print(i+" "); } LinkedHashMap L=new LinkedHashMap(); for(char i:ch){ if(L.containsKey(i)) { L.put(i,L.get(i)+1); } else { L.put(i,1); } } for(char i:L.keySet()) { s1=s1+i+L.get(i); } System.out.println(s1); } }