Beginner friendly python solution
Time Complexity : O(n*logn)\n\nclass Solution(object):\n    def minimumSum(self, num):\n        arr = sorted(str(num))\n        return int(arr[0] + arr[3]) + in
**Time Complexity : O(n*logn)**\n```\nclass Solution(object):\n    def minimumSum(self, num):\n        arr = sorted(str(num))\n        return int(arr[0] + arr[3]) + int(arr[1] + arr[2])\n```
['Python']