Reduce a string of lowercase characters in range
ascii[‘a’..’z’]by doing a series of operations. In each operation, select a pair of adjacent letters that match, and delete them.
Delete as many characters as possible using this method and return the resulting string. If the final string is empty, return
aab shortens to
b in one operation: remove the adjacent
Remove the two 'b' characters leaving 'aa'. Remove the two 'a' characters to leave ''. Return 'Empty String'.
Complete the superReducedString function in the editor below.
superReducedString has the following parameter(s):
- string s: a string to reduce
- string: the reduced string or
A single string, .
Sample Input 0
Sample Output 0
Perform the following sequence of operations to get the final string:
aaabccddd → abccddd → abddd → abd
Sample Input 1
Sample Output 1
aa → Empty String
Sample Input 2
Sample Output 2
baab → bb → Empty String