String Compression

Given a string of alphabets (from a to z), Print the count of the character appearing in the string right next to it. This is also called Run Length Encoding or String Compression.

Hash map approach

In order to count the characters appearing in a string, create a map object that will store all the counts of variables.
Iterate over the string and check if the current element is in the map. If not add it to the map and initialize it to 1. Otherwise, increment the count.
Run a for loop on the created map object (called hash map), Print the count along with the key of the hash map.
return the newly generated string.

Time Complexity

O(n) - Since we are iterating the array twice but separately.

Solve String Compression on Algochurn

#Strings #searching #Amazon #Hewlett-Packard #Netflix

Practice all the solutions below

JavaScript (Node.js 12.14.0)

Algochurn Theme

Practice the most popular front-end questions asked in coding interviews with Frontend Churn

00:00:00

Expand Solution

Character Counts

Given a string of alphabets (from a to z), Print the count of the character appearing in the string right next to it. This is also called Run Length Encoding.

Example

Input

str = "aabbcccddddeeeee"

Output

str = "2a2b3c4d5e"

Explanation

Every character appearing in the string will have the count printed right next to it. In the above example, a appeared 2 times, b appeared 3 times and so on.

Example

Input

str = "azvdaaarrtaaa"

Output

str = "7a1z1v1d2r1t"

Explanation

Same approach as before, All the count of a specific character are printed before the string character. Note that even if the character is repeated after an interval of unique characters, they'll be printed at the place where they first occured.

Stuck? Check out hints

Can you try using a hash map / Object /map to keep the count of the characters?

A good idea will be to store the characters first and then iterate over them to print their frequencies.

Uploaded by: Manu Arora

Share this problem on

#Strings #searching #Amazon #Hewlett-Packard #Netflix

String Compression

Hash map approach

Time Complexity

Practice all the solutions below

Character Counts

Example

Input

Output

Explanation

Example

Input

Output

Explanation

Stuck? Check out hints

Pages

Algochurn

Frontend Churn

Friends

Links