Python, easy, using stack and min heap.
Using stack and minheap\n\n# Code\n\nfrom heapq import heapify, heappush, heappop\n\nclass Solution:\n    def clearStars(self, string: str) -> str:\n        s =
Using stack and minheap\n\n# Code\n```\nfrom heapq import heapify, heappush, heappop\n\nclass Solution:\n    def clearStars(self, string: str) -> str:\n        s = []\n        h = []\n        heapify(h)\n        \n        for i in string:\n            # print(s, h)\n            if i != \'*\':\n                s.append(i)\n                heappush(h, i)\n            else:\n                to_remove = heappop(h)\n                \n                temp_stack = []\n                \n                while s[-1] != to_remove:\n                    temp_stack.append(s.pop())\n                \n                s.pop()\n                \n                while temp_stack:\n                    s.append(temp_stack.pop())\n                    \n        return "".join(s)\n```
['Stack', 'Heap (Priority Queue)', 'Python3']