Python || 96.20% Faster || 2 Lines || Sorting
\nclass Solution:\n    def maxProductDifference(self, nums: List[int]) -> int:\n        nums.sort()\n        return (nums[-1]*nums[-2])-(nums[0]*nums[1])\n\n\nU
```\nclass Solution:\n    def maxProductDifference(self, nums: List[int]) -> int:\n        nums.sort()\n        return (nums[-1]*nums[-2])-(nums[0]*nums[1])\n```\n\n**Upvote if you like the solution or ask if there is any query**
['Sorting', 'Python', 'Python3']