if (arr.length < 3)
            return -1;
        int minDiff = Math.abs(arr[0] + arr[1] + arr[2] - target);
        int bestTillNow = arr[0] + arr[1] + arr[2];
        for (int i = 0; i < arr.length; i++) {
            for (int j = i + 1; j < arr.length; j++) {
                for (int k = j + 1; k < arr.length; k++) {
                    int newDiff = Math.abs(arr[i] + arr[j] + arr[k] - target);
                    if (newDiff < minDiff) {
                        minDiff = newDiff;
                        bestTillNow = arr[i] + arr[j] + arr[k];
                    }
                }
            }
        }
        return bestTillNow;