An encoded string (s) is given, the task is to decode it. The pattern in which the strings are encoded is as follows.
<count>[sub_str] ==> The substring 'sub_str' appears count times.
Input : str = "1[b]" Output : b Input : str = "2[ab]" Output : abab Input : str = "2[a2[b]]" Output : abbabb Input : str = "3[b2[ca]]" Output : bcacabcacabcaca
The idea is to use two stacks, one for integers and another for characters.
Now, traverse the string,
- Whenever we encounter any number, push it into the integer stack and in case of any alphabet (a to z) or open bracket (‘[‘), push it onto the character stack.
- Whenever any close bracket (‘]’) is encounter pop the character from the character stack until open bracket (‘[‘) is not found in the character stack. Also, pop the top element from the integer stack, say n. Now make a string repeating the popped character n number of time. Now, push all character of the string in the stack.
Below is implementation of this approach:
<!—-Illustration of above code for “3[b2[ca]]”>
This article is contributed by Anuj Chauhan. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Decode an Encoded Base 64 String to ASCII String
- Decode the string encoded with the given algorithm
- String formed with middle character of every right substring followed by left sequentially
- Count occurrences of a substring recursively
- Decode a median string to the original string
- Check if a string can become empty by recursively deleting a given sub-string
- Rearrange a string in sorted order followed by the integer sum
- Rearrange a string in the form of integer sum followed by the minimized character
- Check if a string can be split into substrings starting with N followed by N characters
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9
- Given a number as a string, find the number of contiguous subsequences which recursively add up to 9 | Set 2
- Check If every group of a's is followed by a group of b's of same length
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Partition given string in such manner that i'th substring is sum of (i-1)'th and (i-2)'th substring
- Count of binary strings of length N having equal count of 0's and 1's and count of 1's ≥ count of 0's in each prefix substring
- Recursively print all sentences that can be formed from list of word lists
- Find middle of singly linked list Recursively
- Recursively Reversing a linked list (A simple implementation)
- Recursively remove all adjacent duplicates
- Search in a trie Recursively