Tag Archives: Smallest Difference

Here’s the problem statement: Given two arrays of integers, find a pair of integers – one from each array such that the length of the real number line between them is the smallest. Assume there is only one such pair. For example:Array1:  1, 11, 15, 2 Array2:  500, 23, 19, 127, 12, 4 Output: 1 (difference betweenContinue reading “Scribble 5: Smallest Difference”