🎯SUPER EASY FOR BEGINNERS 👏
Code


# Code
```python3 []
class Solution:
    def maximumProduct(self, nums: List[int]) -> int:

        a = sorted(nums)
        return max(a[-1]*a[-2]*a[-3], a[0]*a[1]*a[-1])
        
        # 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.
```
![ba0bc1d0-c297-43a2-b6a7-e2a943eaa77b_1701996327.3360279.png](https://assets.leetcode.com/users/images/2f295f18-d150-4d6a-be85-7e2356d196f3_1738603824.6597345.png)

['Python3']