Given two sorted integer arrays nums1 and nums2 and a target product, find a pair (x, y) where x is from nums1 and y is from nums2 such that x * y == target, prioritizing the largest x and smallest y.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.