Leetcode•Feb 09, 2026
Maximum Product of Three Numbers
Hazrat Ali
Leetcode
Given an integer array nums, find three numbers whose product is maximum and return the maximum product.
Example 1:
Input: nums = [1,2,3] Output: 6
Example 2:
Input: nums = [1,2,3,4] Output: 24
Example 3:
Input: nums = [-1,-2,-3] Output: -6
Solution
var maximumProduct = function(nums) {
nums.sort((a, b) => a - b);
let n = nums.length;
let product1 = nums[n - 1] * nums[n - 2] * nums[n - 3];
let product2 = nums[0] * nums[1] * nums[n - 1];
return Math.max(product1, product2);
};