Java Solution Daily Challenge 18 Dec
Code\n\nclass Solution {\n    public int maxProductDifference(int[] nums) {\n        Arrays.sort(nums);\n        return nums[nums.length-1]*nums[nums.length-2] 
# Code\n```\nclass Solution {\n    public int maxProductDifference(int[] nums) {\n        Arrays.sort(nums);\n        return nums[nums.length-1]*nums[nums.length-2] - nums[0]*nums[1];\n    }\n}\n```
['Java']