O(N) find 4 smallest and 4 largest, 82% speed
Runtime: 332 ms, faster than 81.63% of Python3 online submissions for Minimum Difference Between Largest and Smallest Value in Three Moves.\nMemory Usage: 24.1 
Runtime: 332 ms, faster than 81.63% of Python3 online submissions for Minimum Difference Between Largest and Smallest Value in Three Moves.\nMemory Usage: 24.1 MB, less than 75.23% of Python3 online submissions for Minimum Difference Between Largest and Smallest Value in Three Moves.\n```\nclass Solution:\n    def minDifference(self, nums) -> int:\n        if len(nums) > 4:\n            s1 = s2 = s3 = s4 = float("inf")\n            l1 = l2 = l3 = l4 = float("-inf")\n            for n in nums:\n                if n < s1:\n                    s4 = s3\n                    s3 = s2\n                    s2 = s1\n                    s1 = n\n                elif n < s2:\n                    s4 = s3\n                    s3 = s2\n                    s2 = n\n                elif n < s3:\n                    s4 = s3\n                    s3 = n\n                elif n < s4:\n                    s4 = n\n                if n > l1:\n                    l4 = l3\n                    l3 = l2\n                    l2 = l1\n                    l1 = n\n                elif n > l2:\n                    l4 = l3\n                    l3 = l2\n                    l2 = n\n                elif n > l3:\n                    l4 = l3\n                    l3 = n\n                elif n > l4:\n                    l4 = n\n            return min(l4 - s1, l3 - s2, l2 - s3, l1 - s4)\n        return 0\n```\n
['Python', 'Python3']