100% ACCEPTANCE..VERY EASY APPROACH ...REDUCING THE MAXIMUM DIFFERENCE IN INTERVAL
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:O(nlogn)\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```\nclass Solution {\npublic:\n    int minimizeSum(vector<int>& num) {\n        if(num.size()==3){\n            return 0;\n        }\n        sort(num.begin(),num.end());\n        int n=num.size();\n        int mini=min(num[n-1]-num[2],num[n-3]-num[0]);\n        return min(mini,num[n-2]-num[1]);\n    }\n};\n```
['Greedy', 'Sorting', 'C++']