Python, 3 lines, well explained, Greedy O(nlogn)
If the size <= 4, then just delete all the elements and either no or one element would be left giving the answer 0.\nelse sort the array\nthere are 4 possibilit
If the size <= 4, then just delete all the elements and either no or one element would be left giving the answer 0.\nelse sort the array\nthere are 4 possibilities now:-\n1. delete 3 elements from left and none from right\n2. delete 2 elements from left and one from right\nand so on.. now just print the minima.\n```\nclass Solution:\n    def minDifference(self, nums: List[int]) -> int:\n        \n        if len(nums) <= 4: return 0\n        nums.sort()\n        return min(nums[-1] - nums[3], nums[-2] - nums[2], nums[-3] - nums[1], nums[-4] - nums[0])\n```
['Python', 'Python3']