Question

How to find the minimum product among all combinations of triplets in an array with JavaScript

Answer 1

function getMinimumTripletProduct(arr) {
	const size = arr.length;
  	if (size <= 2) {
        return Number.MAX_VALUE;
    }
    arr.sort(function(a, b) {return a - b;});
        
    return Math.min(arr[size - 1] * arr[size - 2] * arr[0], arr[0] * arr[1] * arr[2]);
}

const arr = [3, 5, 8, 17, 4, 9, 7, 39, 2];

const min = getMinimumTripletProduct(arr);

if (min == Number.MAX_VALUE) {
    console.log("Array has less than 3 elements");
} 
else {
       console.log("The minimum product = " + min);
}


  
  
  
  
/*
run:
  
"The minimum product = 24"
  
*/

 

70+ SQL courses for beginners and professionals