Question

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

Answer 1

import java.util.Arrays;
 
public class MyClass
{
    public static int getMinimumTripletProduct(int[] arr) {
        int size = arr.length;
        
        if (size <= 2) {
            return Integer.MAX_VALUE;
        }
 
        Arrays.sort(arr);
 
        return Integer.min(arr[size - 1] * arr[size - 2] * arr[0], arr[0] * arr[1] * arr[2]);
    }
 
    public static void main(String[] args)
    {
        int[] arr = { 3, 5, 8, 17, 4, 9, 7, 39, 2 };
 
        int min = getMinimumTripletProduct(arr);
 
        if (min == Integer.MAX_VALUE) {
            System.out.print("Array has less than 3 elements");
        }
        else {
            System.out.print("The minimum product = " + min);
        }
    }
}




/*
run:

The minimum product = 24

*/

 

70+ SQL courses for beginners and professionals