Python O(NlogN) Solution Beat 100%
Sort the array first, then check the product of (3 largest positive numbers) and (2 largest negative numbers and largest positive numbers).\n\n\nclass Solution:
Sort the array first, then check the product of (3 largest positive numbers) and (2 largest negative numbers and largest positive numbers).\n\n```\nclass Solution:\n    def maximumProduct(self, nums: List[int]) -> int:\n        nums.sort()\n        return max(nums[0]*nums[1]*nums[-1], nums[-1]*nums[-2]*nums[-3])\n```
['Python', 'Python3']