This is a solution that worked.

solutionNew.java

import java.util.Arrays;

public class Solution {
    
    public int solution(int[] A) {
        Arrays.sort(A);
        int l = A.length;
        int result = A[l - 1] * A[l - 2] * A[l - 3];
        if(A[0] * A[1] > 0 && A[0] < 0) {
            int altResult = A[0] * A[1] * A[l - 1];
            if(altResult > result) return altResult;
        }
        return result;
    }
}