EASY 1ms 99.88% O(N) SOLUTION WITHOUT SORTING
\nclass Solution {\n    public int maxProductDifference(int[] nums) {\n        int max1 = Integer.MIN_VALUE;\n        int max2 = max1;\n\n        int min1 = Int
```\nclass Solution {\n    public int maxProductDifference(int[] nums) {\n        int max1 = Integer.MIN_VALUE;\n        int max2 = max1;\n\n        int min1 = Integer.MAX_VALUE;\n        int min2 = min1;\n        for (int i = 0; i < nums.length; i++) {\n            if (max1 < nums[i]) {\n                max2 = max1;\n                max1 = nums[i];\n            } else if(nums[i] > max2)\n                max2 = nums[i];\n\n            if(min1 > nums[i]){\n                min2 = min1;\n                min1 = nums[i];\n            }else if (nums[i] < min2)\n                min2 = nums[i];\n        }\n        \n        return (max1 * max2) - (min1 * min2);\n    }\n}\n```\nPLEASE ***UPVOTE***, if you find this solution helpful! :D
['C', 'Java', 'C#']