CareerCup

take 2 pointers both pointing to the starting of the array A and B respectively
Now find the difference.
Move the pointer pointing to the lesser of the 2 ahead
Let say
A = 3,10,20
B = 2,5,15

first step 3-2 = 1
Now move pointer B to 5
5-3 = 2.
Now move pointer A to 10 and so on...

The idea is move that pointer which is pointing to the lesser value of the 2 so as to reduce the diff between numbers.

For the first part, find the min of A and max of A, and similarly min B and max B. Answer would be min(abs(minA-maxB),abs(maxA-minB))

do merge both array then find minimum consecutive difference in that merge array having time complexity 2*(m+n) or o(m+n)

min <- A[0]-B[0] // Assuming non negative number in the array
i,j <- start of array
while not end of array
do
temp <- A[i]-B[j]
if (temp < min)
min <- temp
if temp < 0
i++
else
j++
end while

Merge both the arrays O(m+n)

Differ 2 consecutive numbers(Keep checking both do not belong to same array). Track minimum.

We can use different Data Structure to capture array information.

Can somebody explain the remaining question :
Then he extended the same question to n sorted arrays with k elements each. I was required to find the minimum range in which the values fall.

Do something similar to merge operation :

For ex:
A = [1, 3, 5]
B = [8, 9, 10]

i = 0
j = 0

mindiff = INT_MAX;
while(i < m && j < n)
{

if(mindiff > |a[i] - b[j]|)
mindiff = |a[i] - b[j]|;

if(a[i] < b[j])
i++;
else
j++;
}

print mindiff;