fastest solution possibles in python
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nstack\n# Complexity\n- 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nstack\n# Complexity\n- Time complexity:n\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:n\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def removeDuplicates(self, s: str) -> str:\n        ans=[]\n        for a in s:\n            if(len(ans)>0 and ans[-1]==a):\n                ans.pop()\n            else:\n                ans.append(a)\n        return("".join(ans))\n```
['Stack', 'Python3']