Ez C# solution (3-liner)
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \nSolution: \nUse the Arr
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\nSolution: \nUse the Array.Sort() method to sort the array.\n\nAfter sorting, the two smallest numbers are at the first two positions and the two largest numbers are at the last two positions of the array.\n\nCalculate the product of the two largest numbers and subtract the product of the two smallest numbers.\n\nReturn the result.\n# Complexity\n- Time complexity: O(n log n)\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity: O(1)\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\npublic class Solution {\n    public int MaxProductDifference(int[] nums) {\n        Array.Sort(nums);\n        int result = (nums[nums.Length - 2] * nums[nums.Length - 1]) - (nums[0] * nums[1]);\n        return result;\n    }\n}\n```
['C#']