Some problem solving programming challenges, i have solved. Not all are here, but started adding them slowly.
This project is maintained by chankruze
You need to decompress text. The compressed version has a number next to each symbol/letter, representing the amount of time that symbol should appear.
For example, a2b3 is the compressed version of aabbb.
Write a program that takes the compressed text as input and outputs the decompressed version.
A single string with letters/symbols, each followed by a number.
A string, representing the decompressed text.
k2&4b1
kk&&&&b
The letter k appears 2 times, the symbol & appears 4 times and the letter b appears once.
| Language | Solution |
|---|---|
| C | not available |
| CPP | not available |
| C# | not available |
| Python | available |
| Java | not available |
| Ruby | not available |
| Swift | not available |