Untitled

def solve(self, A):
    stack=[]
    for ch in A:
        if stack and ch==stack[-1]:
            stack.pop()
        else:
            stack.append(ch)
    return "".join(stack)