Printing frequency of each character just after its consecutive occurrences

21 Jun, 2022
Given a string in such a way that every character occurs in a repeated manner. Your task is to print the string by inserting the frequency of each unique character after it and also eliminating all repeated characters.Examples:  
Input : GeeeEEKKKss
Output : G1e3E2K3s2

Input : ccccOddEEE
Output : c4O1d2E3
 
One approach to solve the above problem is to start a loop till the end of the string and for every iteration, increment a count till the character at ith position matches the following character. Below is the implementation to the above given problem.  
C++
Java
Python 3
C#
Javascript
// CPP program to print run// length encoding of a string#include <iostream>using namespace std; void printRLE(string s){    for (int i = 0; s[i] != '\0'; i++) {         // Counting occurrences of s[i]        int count = 1;        while (s[i] == s[i + 1]) {            i++;            count++;        }        cout << s[i] << count << " ";    }     cout << endl;} // Driver codeint main(){    printRLE("GeeeEEKKKss");    printRLE("ccccOddEEE");    return 0;}
// Java program to print run// length encoding of a stringclass GFG {     static void printRLE(String s)    {        for (int i = 0; i < s.length(); i++) {             // Counting occurrences of s[i]            int count = 1;            while (i + 1 < s.length()                   && s.charAt(i)                          == s.charAt(i + 1)) {                i++;                count++;            }            System.out.print(s.charAt(i)                             + "" + count + " ");        }         System.out.println();    }     // Driver code    public static void main(String args[])    {        printRLE("GeeeEEKKKss");        printRLE("ccccOddEEE");    }} // This code is contributed// by Arnab Kundu
# Python 3 program to print run# length encoding of a string def printRLE(s) :     i = 0    while( i < len(s) - 1) :         # Counting occurrences of s[i]        count = 1         while s[i] == s[i + 1] :             i += 1            count += 1                         if i + 1 == len(s):                break                 print(str(s[i]) + str(count),                            end = " ")        i += 1         print() # Driver Codeif __name__ == "__main__" :     # function calling    printRLE("GeeeEEKKKss")    printRLE("cccc0ddEEE") # This code is contributed by ANKITRAI1
// C# program to print run// length encoding of a stringusing System; class GFG {     static void printRLE(String s)    {        for (int i = 0;             i < s.Length - 1; i++) {             // Counting occurrences of s[i]            int count = 1;            while (s[i] == s[i + 1]) {                i++;                count++;                if (i + 1 == s.Length)                    break;            }            Console.Write(s[i] + "" + count + " ");        }         Console.WriteLine();    }     // Driver code    public static void Main(String[] args)    {        printRLE("GeeeEEKKKss");        printRLE("ccccOddEEE");    }} // This code contributed by Rajput-Ji
<script>// Javascript program to print run// length encoding of a stringfunction printRLE(s){    for(var i = 0; i < s.length; i++)    {                 // Counting occurrences of s[i]        var count = 1;        while (i + 1 < s.length &&               s.charAt(i) == s.charAt(i + 1))        {            i++;            count++;        }        document.write(s.charAt(i) + "" +                             count + " ");    }    document.write("<br>");} // Driver codeprintRLE("GeeeEEKKKss");printRLE("ccccOddEEE"); // This code is contributed by Ankita saini </script>
G1 e3 E2 K3 s2 
c4 O1 d2 E3 
 
Time Complexity: O(n)Auxiliary Space: O(1)
andrew1234
ankthon
Rajput-Ji
gp6
Johari Saurabh
ankita_saini
pushpeshrajdx01
frequency-counting
Sorting
Sorting
Writing code in comment?
Please use ide.geeksforgeeks.org,
generate link and share the link here.
std::sort() in C++ STL
Time Complexities of all Sorting Algorithms
Count Inversions in an array | Set 1 (Using Merge Sort)
Merge two sorted arrays
Sort an array of 0s, 1s and 2s | Dutch National Flag problem
Radix Sort
Chocolate Distribution Problem
Find a triplet that sum to a given value
k largest(or smallest) elements in an array
sort() in Python