Python 3 solution
Intuition\n Describe your first thoughts on how to solve this problem. \nSimple loopless approach using Mathematics\n\n# Approach\n Describe your approach to so
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\nSimple loopless approach using Mathematics\n\n# Approach\n<!-- Describe your approach to solving the problem. -->After we convert the given 4 digit number type and sort it, the addition of (first digit,last digit) with (second digit,third digit) gives us least combo.\n\n# Complexity\n- Time complexity:\n```\nO(nlogn)\n```\n\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def minimumSum(self, num: int) -> int:\n        num = str(num)\n        num = sorted(list(num))\n        num = str(num)\n        print(num)\n        list1 = list()\n        list1.append((num[2]+num[17]))\n        list1.append((num[7]+num[12]))\n        return (int(list1[0])+int(list1[1]))\n```
['Python3']