Compressed String decoding for Kth character
Last Updated :
13 Dec, 2023
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 Kth 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 Kth value 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;
}
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 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
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 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)
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 Kth 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 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 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
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';
}
}
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
Time Complexity: O(N), where N is the length of the string.
Auxiliary Space: O(1).
Similar Reads
Find k'th character of decrypted string | Set 1
Given an encoded string, where repetitions of substrings are represented as substring followed by count of substrings. For example, if encrypted string is "ab2cd2" and k=4 , so output will be 'b' because decrypted string is "ababcdcd" and 4th character is 'b'. Note: Frequency of encrypted substring
8 min read
Decode the String of special characters
Given an input string S of special characters where "@" represents "01", "#@" represents "111" and "##" represents "00". Decode the input string of special characters and print the number formed by decoding it. Examples: Input: S = "@#@##" Output: 60Explaination: @ represents "01" followed by #@ whi
9 min read
Understanding Character Encoding
Ever imagined how a computer is able to understand and display what you have written? Ever wondered what a UTF-8 or UTF-16 meant when you were going through some configurations? Just think about how "HeLLo WorlD" should be interpreted by a computer. We all know that a computer stores data in bits an
6 min read
Python Dictionary to find mirror characters in a string
Given a string and a number N, we need to mirror the characters from the N-th position up to the length of the string in alphabetical order. In mirror operation, we change ‘a’ to ‘z’, ‘b’ to ‘y’, and so on. Examples: Input : N = 3 paradox Output : paizwlc We mirror characters from position 3 to end.
2 min read
Length of minimized Compressed String
Given a string S, the task is to find the length of the shortest compressed string. The string can be compressed in the following way: If S = "ABCDABCD", then the string can be compressed as (ABCD)2, so the length of the compressed string will be 4.If S = "AABBCCDD" then the string compressed form w
10 min read
Encode an ASCII string into Base-64 Format
Base 64 is an encoding scheme that converts binary data into text format so that encoded textual data can be easily transported over network un-corrupted and without any data loss. Base64 is used commonly in a number of applications including email via MIME, and storing complex data in XML. Problem
15+ min read
K'th Non-repeating Character
Given a string str of length n (1 <= n <= 106) and a number k, the task is to find the kth non-repeating character in the string.Examples: Input : str = geeksforgeeks, k = 3Output : rExplanation: First non-repeating character is f, second is o and third is r.Input : str = geeksforgeeks, k = 2O
14 min read
Check if String S can be compressed to T by replacing some X characters with count X
Given two strings, S and T where S is a normal string and T is a compressed string, the task is to determine if the compressed string T can be achieved by compressing the string S. Note: A compression mechanism can arbitrarily delete X (X >= 0) characters and replace them with the deleted charact
7 min read
Lexicographically next greater string using same character set
Given a number K and a string S, We have to Find the lexicographically smallest string str of length K such that it's set of letters is a subset of the set of letters of S and S is lexicographically smaller than str. Examples: Input :k = 3 s = zbf Output: zbz Explanation: zbz is greater than zbf and
8 min read
Reduce the string by removing K consecutive identical characters
Given a string str and an integer k, the task is to reduce the string by applying the following operation any number of times until it is no longer possible:Choose a group of k consecutive identical characters and remove them from the string.Finally, print the reduced string.Examples: Input: K = 2,
7 min read