CareerCup

can u pls explain the question with an example?

The diameter of apple is 62mm.the shortest path is straight one that is (31*2= 62) to pass through the center.

So, the tunnel can be at most a chord.so we can always get a half part without rotten.

The below code will work:
1.Find the minimum and maximum element and find the distance.(max-min)
If that is > current minimum distance advance the min index


public class Triplets{

public static void main(String[] args) {

int a[] = {4,6};
int b[] = {3,5};
int c[] = {1,2,7};

int i=0,j=0,k=0;//counters
int min, max;
int mindist=100000, mini=0, minj=0, mink=0;

while(i<a.length && j<b.length && k<c.length)
{
min = a[i];

if(b[j]<min)
{
min = b[j];
}
if(c[k]<min)
{
min = c[k];
}
max=a[i];

if(b[j]>max)
{
max=b[j];
}
if(c[k]>max)
{
max = c[k];
}
if((max - min)<mindist)
{
mindist = max - min;
mini=i;
minj=j;
mink=k;
}
if(a[i]==min)
i++;
if(b[j]==min)
j++;
if(c[k]==min)
k++;

}
System.out.printf("%d\n%d\n%d\n", a[mini], b[minj], c[mink]);

}
}