Question

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

Answer 1

using System;

public class AClass
{
	public static int getMinimumTripletProduct(int[] arr)
	{
		int size = arr.Length;

		if (size <= 2) {
			return int.MaxValue;
		}

		Array.Sort(arr);

		return Math.Min(arr[size - 1] * arr[size - 2] * arr[0], arr[0] * arr[1] * arr[2]);
	}

	public static void Main(string[] args)
	{
		int[] arr = new int[] {3, 5, 8, 17, 4, 9, 7, 39, 2};

		int min = getMinimumTripletProduct(arr);

		if (min == int.MaxValue) {
			Console.Write("Array has less than 3 elements");
		}
		else {
			Console.Write("The minimum product = " + min);
		}
	}
}




/*
run:
 
The minimum product = 24
 
*/

 

70+ SQL courses for beginners and professionals