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

/**
 Ninja has been given a program to do basic string compression. For a character that is consecutively repeated more than once, he needs to replace the consecutive duplicate occurrences with the count of repetitions.

 Exa:
 If a string has 'x' repeated 5 times, replace this "xxxxx" with "x5". The string is compressed only when the repeated character count is more than 1.
 */

 let str = 'a bb ccc dddd eeeee f    g hhhh jj kkkkkkkkkkkk ll mn kkkkahhaall'
 function compressString(str) {
    let cstr='';
    let i=0;
    while(i < str.length) {
        let occurrences = 1;
        for (let j=i+1; str[i] === str[j]; j++) {
            occurrences++;
        }

        cstr += str[i]
        if (occurrences > 1) {
            cstr += occurrences;
        }
        i+=occurrences;
    }
    return cstr;
 }

 console.log(compressString(str));

String Compression Problem Statement

Input:

Output:

Example:

Constraints:

Note:

Top Nagarro Software Developer interview questions & answers

Popular interview questions of Software Developer

Top HR questions asked in Nagarro Software Developer