Find Pair With Smallest Difference Problem Statement

Given two unsorted arrays of non-negative integers, arr1 and arr2 with sizes N and M, determine the pair of elements (one from each array) which have the smallest absolute (non-negative) difference, and return that difference.

Example:

Input:

N = 3, arr1 = [10, 20, 30]
M = 2, arr2 = [17, 15]

Output:

3

Explanation:

The pair (20, 17) has the smallest absolute difference of 3.

Constraints:

• 1 <= T <= 10
• 1 <= N, M <= 1000
• 0 <= arr1[i], arr2[i] <= 10^6
• Time Limit: 1 second

Note:

Both arrays are unsorted, and all elements are non-negative integers.