Easy to Understand Pythonic solution
Some of the solutions to this problem seemed to be not very easy to understand so here\'s my take:\n\n# Explanation:\nWe put all our digits in a list, sort them
*Some of the solutions to this problem seemed to be not very easy to understand so here\'s my take:*\n\n# **Explanation:**\nWe put all our digits in a list, sort them with a built-in method **sort()** (so that the numbers are sorted from smallest to highest), join 1st + 3d and 2nd+ 4th elements as string, cast into ints and return their summ.\n\n# **Why does this work?**\nThis works because the smallest possible numbers from a 4-number array would both start with smallest number ( hence the 1st and 2nd digit being picked for the start of our integer)\n\n# Code\n```\nclass Solution:\n    def minimumSum(self, num: int) -> int:\n        digits = []\n\n        for i in str(num):\n            digits.append(i)\n\n        digits.sort()\n\n        return int(digits[0] + digits[2]) + int(digits[1] + digits[3])\n```
['Python3']