C++ easy sol 2 line of code explained  ✔️ ✔️
The basic approach is to get maximum product  differnce is to chose the minimum and max product simply sort and take first two and last two numbers\n\nclass Sol
The basic approach is to get maximum product  differnce is to chose the minimum and max product simply sort and take first two and last two numbers\n```\nclass Solution {\npublic:\n    int maxProductDifference(vector<int>& nums) {\n        sort(nums.begin(),nums.end());\n        return nums[nums.size()-1]*nums[nums.size()-2]-nums[0]*nums[1];\n    }\n};\n```
['C', 'Sorting']