Steve has a string of lowercase characters in range ascii[‘a’..’z’]. He wants to reduce the string to its shortest length by doing a series of operations. In each operation he selects a pair of adjacent lowercase letters that match, and he deletes them. For instance, the string aab could be shortened to b in one operation.
Steve’s task is to delete as many characters as possible using this method and print the resulting string. If the final string is empty, print Empty String
aaabccddd → abccddd → abddd → abd
aa → Empty String
baab → bb → Empty String
string superReducedString(string s) {
for(int i=0;i<s.size()-1;)
{
if(s.size()==0)
{ return "Empty String";}
if(s[i]==s[i+1])
{
s.erase(i,2);
i=0;
}
else
{
i++;
}
}
return s;
