easiest two lines of code#python3
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def maximumProduct(self, nums: List[int]) -> int:\n        nums.sort()\n        return max(nums[-1]*nums[-2]*nums[-3],nums[0]*nums[1]*nums[-1])\n        #please do upvote as it makes me to code more.\n```\n# consider upvoting\n![57jfh9.jpg](https://assets.leetcode.com/users/images/87ef3605-c51d-49d4-838c-96713a68dd0d_1679115834.105351.jpeg)\n
['Python3']