Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).

MaxProductOfThree.java

import java.util.Arrays;

public class MaxProductOfThree {
	public int solution(int[] A) {
		if(A == null || A.length < 3) {
			return 0;
		}
		
		Arrays.sort(A);
		
		int lastIndex = A.length - 1;
		int bigestElements = A[lastIndex] * A[lastIndex - 1] * A[lastIndex - 2];
		int twoBigestNegs = A[0] * A[1] * A[lastIndex];
		
		int maxProduct = Math.max(bigestElements, twoBigestNegs);
		return maxProduct;
	}
}