[Python3] Greedy Algorithm - Priority Queue (min heap) - Easy understanding
TC: O(4log3)\nSC: O(4)\n\n\ndef minimumSum(self, num: int) -> int:\n        digits = []\n        while num:\n            heappush(digits, num % 10)\n           
TC: O(4log3)\nSC: O(4)\n\n```\ndef minimumSum(self, num: int) -> int:\n        digits = []\n        while num:\n            heappush(digits, num % 10)\n            num //= 10\n        \n        i = 0\n        num1, num2 = 0, 0\n        while digits:\n            if i % 2 == 0:\n                num1 = num1 * 10 + heappop(digits)\n                i += 1\n            else:\n                num2 = num2 * 10 + heappop(digits)\n                i -= 1\n        \n        return num1 + num2\n```
['Greedy', 'Heap (Priority Queue)', 'Python', 'Python3']