Solution 1 - Sort

Maximum is max(product of 3 largest, product of 2 smallest and largest).

TimeComplexity: O(n \log n)

SpaceComplexity: O(1)

""" 0628.1 - Maximum Product of Three Numbers - Solution 1 - Sort """

from typing import List

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])

package main

import "sort"

func maximumProduct(nums []int) int {
	sort.Ints(nums)
	n := len(nums)
	p1 := nums[n-1] * nums[n-2] * nums[n-3]
	p2 := nums[0] * nums[1] * nums[n-1]
	if p1 > p2 { return p1 }
	return p2
}

func main() {}

fn maximum_product(mut nums: Vec<i32>) -> i32 {
	nums.sort_unstable();
	let n = nums.len();
	let p1 = nums[n-1] * nums[n-2] * nums[n-3];
	let p2 = nums[0] * nums[1] * nums[n-1];
	p1.max(p2)
}
fn main() {}

0628 - Maximum Product of Three Numbers

Solution 1 - Sort