Only 4 cases possible||Beats 91%
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:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution {\npublic:\n    int minDifference(vector<int>& nums) {\n        int n = nums.size();\n        if(n<=4)\n        {\n            return 0;\n        }\n\n        sort(nums.begin(),nums.end());\n        int ans1 = abs(nums[0]-nums[n-4]);\n        int ans2 = abs(nums[3]-nums[n-1]);\n        int ans3 = abs(nums[1]-nums[n-3]);\n        int ans4 = abs(nums[2]-nums[n-2]);\n\n        return min(min(ans1,ans2),min(ans3,ans4));\n    }\n};\n```
['C++']