1
class Solution:
2
def removeDuplicates(self, S: str) -> str:
3
stack = []
4
for char in S:
5
if stack and stack[-1] == char:
6
stack.pop()
7
else:
8
stack.append(char)
9

10
return "".join(stack)

0

WPM •0 •0

100%

ACC •0 •0

0s

TIME •0