Easy one liner solution
Approachnum.sort() sorts the list in ascending ordernums[-1]*nums[-2]*nums[-3] gives the product of 3 maximum number (positive)nums[0]*nums[1]*nums[-1] gives th
# Approach
num.sort() sorts the list in ascending order

nums[-1]*nums[-2]*nums[-3] gives the product of 3 maximum number (positive)

nums[0]*nums[1]*nums[-1] gives the product of 2 biggest negative number not considering the negative sign and the biggest positive number.
This is done as product of 2 negative number is always a positive number since we take 2 largest negative number without sign

so eg, [-100,-98,-6,0,1,2]
here the product of -100,-98,-6 will be a negative number 
so we take -100,-98 and 2 to get the max product.

max of these will give the largest product possible

# Code
```python3 []
class Solution:
    def maximumProduct(self, nums: List[int]) -> int:
        nums.sort()
        return max(nums[-1]*nums[-2]*nums[-3],nums[0]*nums[1]*nums[-1])

        
```
['Python3']