Given $k$ sorted arrays of integers, choose one element from each array such that the difference between the maximum and minimum of the chosen elements is minimized. Return the minimum difference.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.