Given two sorted arrays of same length, find pairs of numbers (one from each array) which has the minimum distance between those two numbers. This is the last weeks Thursday Coding Puzzle. Since both arrays are sorted, binary search is going be really useful in searching the values in arrays. Even though this problem is not related to finding the exact matches as in binary search, it is easy to solve this problem with the same approach used in binary search. Read more �
0 Response to "Minimum difference in two sorted arrays"
Post a Comment