Data Modelling & AI Data Structure & Algorithm

Compressed String decoding for Kth character

28 July 2024

0

Given a compressed string composed of lowercase characters and numbers, the task is to decode the compressed string and to find out the character located at the K^th position in the uncompressed string, You can transform the string by following the rule that when you encounter a numeric value “n”, repeat the preceding substring starting from index 0 ‘n’ times

Examples:

Input: S = “ab2c3” K = 10
Output: “c”
Explanation:

When traversing the string we got the first numeric value 2,

here the preceding Substring =” ab “

So “ab” is repeated twice, Now the string Will be “ababc3”.

The second numeric value we got is 3,

Now, our preceding String is “ababc”

So it will be repeated 3 times.

Now the expanded string will be “ababc” + “ababc” + “ababc” = “ababcababcababc”

10th character is “c”, so the output is “c”.

Input: S = “z3a2s1” K = 12
Output: -1
Explanation: Expanded string will be “zzzazzzas” and have a length of 9, so output -1 (as the Kth index does not exist)

Naive Approach: The basic way to solve the problem is as follows:

The idea is to generate the expanded string and then find the K^thvalue of that string. To do so we will use a string “decoded” and insert the compressed string when encounter a string and if we encounter a digit then we will multiply the string the digit times and store it in “decoded” string .

Below is the implementation of the above idea:

C++

#include <iostream>
#include <string>
 
// Function to find the k-th character in a compressed string
char getKthCharacter(std::string compressedStr, int k) {
    std::string expandedStr;
    int curStrLen = 0;
 
    for (char c : compressedStr) {
        if (std::isdigit(c)) {
            int repeat = c - '0'; // Extract the digit (repetition count)
 
            // Repeat the current expanded string based on the repetition count
            std::string repeated(expandedStr);
            for (int i = 1; i < repeat; i++) {
                expandedStr += repeated;
            }
 
            // Update the length based on repetition
            curStrLen *= repeat;
        } else {
            // If the character is not a digit, simply append it to the expanded string
            expandedStr += c;
 
            // Increment the length
            curStrLen++;
        }
 
        if (curStrLen >= k) {
            return expandedStr[k - 1]; // If we have reached the desired position, 
                                       // return the k-th character
        }
    }
 
    return '\0'; // If the position is out of bounds, return a default value
}
 
int main() {
    std::string S = "ab2c3";
    int K = 10;
 
    char result = getKthCharacter(S, K);
 
    if (result == '\0') {
        std::cout << "Position is out of bounds." << std::endl;
    } else {
        std::cout << "The K-th character is: " << result << std::endl;
    }
 
    return 0;
}

Java

public class KthCharacterInCompressedString {
    // Function to find the k-th character in a compressed string
    public static char getKthCharacter(String compressedStr, int k) {
        int curStrLen = 0; // To keep track of the length of the current expanded string
        StringBuilder expandedStr = new StringBuilder(); // To store the expanded string
 
        for (char c : compressedStr.toCharArray()) {
            if (Character.isDigit(c)) {
                int repeat = Character.getNumericValue(c); // Extract the digit (repetition count)
 
                // Repeat the current expanded string based on the repetition count
                expandedStr = new StringBuilder(expandedStr.toString().repeat(repeat));
 
                // Update the length based on repetition
                curStrLen *= repeat;
            } else {
                // If the character is not a digit, simply append it to the expanded string
                expandedStr.append(c);
 
                // Increment the length
                curStrLen++;
            }
 
            if (curStrLen > k - 1) {
                return expandedStr.charAt(k - 1); // If we have reached the desired 
                                                  // position, return the k-th character
            }
        }
 
        return '\0'; // If the position is out of bounds, return a 
                     // default value (you can change this to -1 if needed).
    }
 
    public static void main(String[] args) {
        String S = "ab2c3";
        int K = 10;
 
        char result = getKthCharacter(S, K);
 
        if (result == '\0') {
            System.out.println("Position is out of bounds.");
        } else {
            System.out.println("The K-th character is: " + result);
        }
    }
}

Python3

# Python3 implementation
# of above approach
 
 
def getKthCharacter(compressed_str, k):
 
   # To keep track of the length of
    # the current expanded string
    cur_str_len = 0
 
    # To store the expanded string
    expanded_str = ""
 
    for char in compressed_str:
 
       # If the character is a digit
        if char.isdigit():
            repeat = int(char)
 
            # Repeat the current
            # expanded string
            expanded_str = expanded_str * repeat
 
            # Update the length
            # based on repetition
            cur_str_len = cur_str_len * repeat
        else:
          # If the character is not a digit,
          # append it to the expanded string
            expanded_str += char
            # Increment the length
            cur_str_len += 1
 
            # If we have reached the
            # desired position
        if cur_str_len > k - 1:
 
            # Return the k-th character
            # from the expanded string
            return expanded_str[k - 1]
 
 # If the position is out of
# bounds, return -1
    return -1
 
 
# Driver Code
S = "ab2c3"
K = 10
 
# Call the getKthCharacter function
# and print the result
print(getKthCharacter(S, K))
 
# This code is contributed by the Author

C#

using System;
 
class GFG
{
    // Function to find the k-th character in a compressed string
    static char GetKthCharacter(string compressedStr, int k)
    {
        string expandedStr = "";
        int curStrLen = 0;
 
        foreach (char c in compressedStr)
        {
            if (char.IsDigit(c))
            {
                int repeat = c - '0'; // Extract the digit (repetition count)
 
                // Repeat the current expanded string based on the repetition count
                string repeated = expandedStr;
                for (int i = 1; i < repeat; i++)
                {
                    expandedStr += repeated;
                }
 
                // Update the length based on repetition
                curStrLen *= repeat;
            }
            else
            {
                // If the character is not a digit, simply append it to the expanded string
                expandedStr += c;
 
                // Increment the length
                curStrLen++;
            }
 
            if (curStrLen >= k)
            {
                return expandedStr[k - 1]; // If we have reached the desired position, 
                                           // return the k-th character
            }
        }
 
        return '\0'; // If the position is out of bounds, return a default value
    }
 
    static void Main()
    {
        string S = "ab2c3";
        int K = 10;
 
        char result = GetKthCharacter(S, K);
 
        if (result == '\0')
        {
            Console.WriteLine("Position is out of bounds.");
        }
        else
        {
            Console.WriteLine($"The K-th character is: {result}");
        }
    }
}

Javascript

// JavaScript implementation
// of above approach
 
function getKthCharacter(compressed_str, k) {
 
  // To keep track of the length of
  // the current expanded string
  let cur_str_len = 0;
 
  // To store the expanded string
  let expanded_str = "";
 
  for (let char of compressed_str) {
 
    // If the character is a digit
    if (!isNaN(char)) {
      let repeat = parseInt(char);
 
      // Repeat the current
      // expanded string
      expanded_str = expanded_str.repeat(repeat);
 
      // Update the length
      // based on repetition
      cur_str_len = cur_str_len * repeat;
    } else {
      // If the character is not a digit,
      // append it to the expanded string
      expanded_str += char;
      // Increment the length
      cur_str_len += 1;
    }
 
    // If we have reached the
    // desired position
    if (cur_str_len > k - 1) {
 
      // Return the k-th character
      // from the expanded string
      return expanded_str[k - 1];
    }
  }
 
  // If the position is out of
  // bounds, return -1
  return -1;
}
 
// Driver Code
let S = "ab2c3";
let K = 10;
 
// Call the getKthCharacter function
// and print the result
console.log(getKthCharacter(S, K));
 
// This code is contributed by Tapesh(tapeshdua420)

Output

Time Complexity: O(N),
Auxiliary Space: O(N), where N is the length of the expanded string.

Efficient Approach: To solve the problem without expanding the string using Recursion :

Initialize a counter to keep track of the current position in the uncompressed string.
Iterate through the compressed string’s characters:
- If a character is a digit, calculate the potential new position in the uncompressed string without expanding the string.
- If the new position is greater than or equal to K, the K^th character lies within the repeated portion. Recurse on that portion with an adjusted K value.
  - If the character is not a digit, increment the counter.
  - If the counter reaches or exceeds k, return the current character as the k-th character.
If the loop completes without finding the k-th character, return -1 to indicate an out-of-bounds position.

Below is the implementation of the above idea:

C++

// C++ code for the above approach:
#include <iostream>
using namespace std;
 
char getKthCharacterWithoutExpansion(string compressed_str,
                                     int k)
{
 
    // To keep track of the position
    // in the uncompressed string
    int count = 0;
 
    for (char ch : compressed_str) {
        if (isdigit(ch)) {
            int repeat = ch - '0';
 
            // Calculate the new position
            int new_count = count * repeat;
 
            // If new position exceeds k
            if (new_count >= k) {
                return getKthCharacterWithoutExpansion(
                    compressed_str, (k - 1) % count + 1);
            }
            count = new_count;
        }
        else {
            count += 1;
        }
 
        // If we have reached the
        // desired position
        if (count >= k) {
 
            // Return the current character
            return ch;
        }
    }
 
    // If the position is
    // out of bounds
    return 0;
}
 
// Driver code
int main()
{
 
    // Input S and K
    string S = "ab2c3";
    int K = 15;
 
    // Call the decoding function
    // and print the result
    char result = getKthCharacterWithoutExpansion(S, K);
    (result == 0) ? cout << -1 : cout << result << endl;
    return 0;
}

Java

//Java code for the above approach
public class GFG {
    public static char getKthCharacterWithoutExpansion(String compressed_str, int k) {
        // To keep track of the position in the uncompressed string
        int count = 0;
 
        for (char ch : compressed_str.toCharArray()) {
            if (Character.isDigit(ch)) {
                int repeat = ch - '0';
 
                // Calculate the new position
                int new_count = count * repeat;
 
                // If new position exceeds k
                if (new_count >= k) {
                    return getKthCharacterWithoutExpansion(compressed_str, 
                                                           (k - 1) % count + 1);
                }
                count = new_count;
            } else {
                count += 1;
            }
 
            // If we have reached the desired position
            if (count >= k) {
                // Return the current character
                return ch;
            }
        }
 
        // If the position is out of bounds
        return '\0';
    }
 
    public static void main(String[] args) {
        // Input S and K
        String S = "ab2c3";
        int K = 15;
 
        // Call the decoding function and print the result
        char result = getKthCharacterWithoutExpansion(S, K);
        if (result == '\0') {
            System.out.println(-1);
        } else {
            System.out.println(result);
        }
    }
}

Python3

# Python3 implementation
# of above approach
 
 
def getKthCharacterWithoutExpansion(compressed_str, k):
   # To keep track of the position
    # in the uncompressed string
    count = 0
 
    for char in compressed_str:
        if char.isdigit():
            repeat = int(char)
 
            # Calculate the new position
            new_count = count * repeat
 
            # If new position exceeds k
            if new_count >= k:
                return getKthCharacterWithoutExpansion(compressed_str, (k - 1) % count + 1)
            count = new_count
        else:
            count += 1
 
        # If we have reached the desired position
        if count >= k:
 
           # Return the current character
            return char
    return -1
 
 
# Driver Code
S = "ab2c3"
K = 15
 
# Call the getKthCharacter
# WithoutExpansion function
# And print the result
print(getKthCharacterWithoutExpansion(S, K))
 
# This code is contributed by the Author

C#

using System;
 
class Program
{
    static void Main()
    {
        string S = "ab2c3";
        int K = 15;
 
        // Call the GetKthCharacterWithoutExpansion function
        // And print the result
        Console.WriteLine(GetKthCharacterWithoutExpansion(S, K));
    }
 
    static char GetKthCharacterWithoutExpansion(string compressedStr, int k)
    {
        // To keep track of the position
        // in the uncompressed string
        int count = 0;
 
        foreach (char c in compressedStr)
        {
            if (char.IsDigit(c))
            {
                int repeat = int.Parse(c.ToString());
 
                // Calculate the new position
                int newCount = count * repeat;
 
                // If new position exceeds k
                if (newCount >= k)
                {
                    return GetKthCharacterWithoutExpansion(compressedStr, (k - 1) % count + 1);
                }
                count = newCount;
            }
            else
            {
                count++;
            }
 
            // If we have reached the desired position
            if (count >= k)
            {
                // Return the current character
                return c;
            }
        }
 
        return '\0'; 
    }
}

Javascript

function main() {
    const S = "ab2c3";
    const K = 15;
 
    // Call the GetKthCharacterWithoutExpansion function
    // And print the result
    console.log(GetKthCharacterWithoutExpansion(S, K));
}
 
function GetKthCharacterWithoutExpansion(compressedStr, k) {
    // To keep track of the position in the uncompressed string
    let count = 0;
 
    for (let i = 0; i < compressedStr.length; i++) {
        const c = compressedStr.charAt(i);
 
        if (!isNaN(parseInt(c))) {
            const repeat = parseInt(c);
 
            // Calculate the new position
            const newCount = count * repeat;
 
            // If new position exceeds k
            if (newCount >= k) {
                return GetKthCharacterWithoutExpansion(compressedStr, (k - 1) % count + 1);
            }
            count = newCount;
        } else {
            count++;
        }
 
        // If we have reached the desired position
        if (count >= k) {
            // Return the current character
            return c;
        }
    }
 
    return '\0';
}
 
main(); // Call the main function

Output

Time Complexity: O(N), where N is the length of the string.
Auxiliary Space: O(1).

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 neveropen!

Commit to GfG’s Three-90 Challenge! Purchase a course, complete 90% in 90 days, and save 90% cost click here to explore.

Last Updated :
13 Dec, 2023

Previous

<!–

8 Min Read | Java

–>

Remove the forbidden strings

Next

<!–

8 Min Read | Java

–>

Accessing characters by index in a String

Share your thoughts in the comments

Compressed String decoding for Kth character

C++

Java

Python3

C#

Javascript

C++

Java

Python3

C#

Javascript

Run Local AWS Cloud Stack using LocalStack on Linux

Learn Terraform Automation in 3 days using Video Courses

How To Expose Ansible AWX Service using Nginx Ingress

LEAVE A REPLY Cancel reply

Most Popular

5 Best Antiviruses With Keylogger Protection in 2025 by Tyler Cross

Best VPNs for School in 2025 That Work With Firewalls by Toma Novakovic

How to Watch the Super Bowl From Anywhere in 2025 by Raven Wu

Best Malware Removal + Protection Software in 2025 by Raven Wu

Recent Comments

EDITOR PICKS

5 Best Antiviruses With Keylogger Protection in 2025 by Tyler Cross

Best VPNs for School in 2025 That Work With Firewalls by Toma Novakovic

How to Watch the Super Bowl From Anywhere in 2025 by Raven Wu

POPULAR POSTS

5 Best Antiviruses With Keylogger Protection in 2025 by Tyler Cross

Best VPNs for School in 2025 That Work With Firewalls by Toma Novakovic

How to Watch the Super Bowl From Anywhere in 2025 by Raven Wu

POPULAR CATEGORY

ABOUT US

FOLLOW US

Compressed String decoding for Kth character

C++

Java

Python3

C#

Javascript

C++

Java

Python3

C#

Javascript

Please Login to comment…

LEAVE A REPLY Cancel reply

Most Popular

Recent Comments

EDITOR PICKS

POPULAR POSTS

POPULAR CATEGORY

ABOUT US

FOLLOW US