Python || Easy || 3Lines || Sorting ||
\nclass Solution:\n    def minimumSum(self, num: int) -> int:\n        n=[num//1000,(num//100)%10,(num//10)%10,num%10] #This line will convert the four digit no
```\nclass Solution:\n    def minimumSum(self, num: int) -> int:\n        n=[num//1000,(num//100)%10,(num//10)%10,num%10] #This line will convert the four digit no. into array \n        n.sort() #It will sort the digits in ascending order\n        return (n[0]*10+n[3])+(n[1]*10+n[2]) # Combination of first and last and the remaining two digits will give us the minimum value\n```\n\n**Upvote if you like the solution or ask if there is any query**
['Sorting', 'Python', 'Python3']