you give string s consist lowercase english letter a duplicate removal consists choose adjacent equal letter remove themWe repeatedly duplicate removal s long canreturn final string duplicate removal it prove answer unique Example 1input s abbacaoutput caexplanation for example abbaca remove bb letter adjacent equal possible the result stre aaca aa possible final string caExample 2input s azxxzyoutput ay Constraints1 slength 105s consist lowercase english letter