public class Solution { public static int findTriplet (int [] arr){ int minNeg1 = 0; int minNeg2 = 0; int minNeg3 = 0; int maxPos1 = 0; int maxPos2 = 0; int minPos1 = Integer.MAX_VALUE; int minPos2 = Integer.MAX_VALUE; int minPos3 = Integer.MAX_VALUE; for (int i = 0; i < arr.length; i++) { if (arr[i] < minNeg1){//we found new minimal negative number minNeg3 = minNeg2;//2nd place >- 3rd place minNeg2 = minNeg1;//1st place >- 2nd place minNeg1 = arr[i];//new 1st place }else if (arr[i] < minNeg2){//we found new 2nd minimal negative number minNeg3 = minNeg2;//2nd place >- 3rd place minNeg2 = arr[i];//new 2nd place }else if (arr[i] < minNeg3){//we found a new 3rd minimal negative number minNeg3 = arr[i]; } if (arr[i] < minPos1){//we found new minimal positive number minPos3 = minPos2;//2nd place >- 3rd place minPos2 = minPos1;//1st place >- 2nd place minPos1 = arr[i];//new 1st place }else if (arr[i] < minPos2){//we found new 2nd minimal positive number minPos3 = minPos2;//2nd place >- 3rd place minPos2 = arr[i];//new 2nd place }else if (arr[i] < minPos3){//we found a new 3rd minimal positive number minPos3 = arr[i]; } if (arr[i] > maxPos1){//we found a new max positive number maxPos2 = maxPos1;//1st place >- 2nd place maxPos1 = arr[i];//new 1st place }else if (arr[i] > maxPos2){//we found a new second max positive number maxPos2 = arr[i];//new 2nd place } } //print and return the max option if (minNeg1*minNeg2*minNeg3 <= minNeg1*maxPos1*maxPos2 && minNeg1*minNeg2*minNeg3 <= minPos1*minPos2*minPos3){ System.out.println(minNeg1+" "+minNeg2+" "+minNeg3); return minNeg1*minNeg2*minNeg3; } if (minNeg1*maxPos1*maxPos2 <= minNeg1*minNeg2*minNeg3 && minNeg1*maxPos1*maxPos2 <= minPos1*minPos2*minPos3){ System.out.println(minNeg1 + " " + maxPos1+ " " + maxPos2); return minNeg1*maxPos1*maxPos2; } System.out.println(minPos1 + " " +minPos2+ " " +minPos3); return minPos1*minPos2*minPos3; } }