Given two integer arrays arr1 and arr2, and an integer d, count the number of elements arr1[i] such that there is no element arr2[j] where the absolute difference |arr1[i] - arr2[j]| <= d.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.