Given two integer arrays X and Y and an integer D, count the number of elements in X such that for every element in Y, the absolute difference between X[i] and Y[j] is at least 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.