Back to course home
0% completed
Solution: Decode String
Problem Statement
You have a string that represents encodings of substrings, where each encoding is of the form k[encoded_string]
, where k
is a positive integer, and encoded_string
is a string that contains letters only.
Your task is to decode this string by repeating the encoded_string
k
times and return it. It is given that k
is always a positive integer.
Examples
-
- Input:
"3[a3[c]]"
- Expected Output:
"acccacccaccc"
- Justification: The inner
3[c]
is decoded asccc
, and thena
is appended to the front, formingacc
- Input:
.....
.....
.....
Like the course? Get enrolled and start learning!
Table of Contents
Contents are not accessible
Contents are not accessible
Contents are not accessible
Contents are not accessible
Contents are not accessible