A/C Python 3 solution, easy to understand
\nclass Solution:\n    def minDifference(self, nums: List[int]) -> int:\n        nums.sort()\n        n = len(nums)\n        if (n <= 4 ):\n            return 0
```\nclass Solution:\n    def minDifference(self, nums: List[int]) -> int:\n        nums.sort()\n        n = len(nums)\n        if (n <= 4 ):\n            return 0\n        \n        res = nums[-1] - nums[0]\n        # kill 3 biggest elements\n        res = min(res, nums[-4] - nums[0])\n        # kill 2 biggest elements + 1 smallest elements\n        res = min(res, nums[-3] - nums[1])\n        # kill 1 biggest elements + 2 smallest elements\n        res = min(res, nums[-2] - nums[2])\n        # kill 3 smallest elements\n        res = min(res, nums[-1] - nums[3])\n        \n        return res\n    \n```
[]