Directi Interview Question Software Engineer / Developers
- 0of 0 votes
Given 2 sorted arrays A and B, sorted in increasing order, find the minimum value of |A[i]-B[j]| for all i belonging to A and all j belonging to B. Preffered order O(M+n) in the worst case. m being size of array A and n being size of array B.
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.