Maximum Distance Between a Pair of Values
You receive two non-increasing 0-indexed integer arrays nums1 and nums2.
A pair of indices (i, j), where 0 <= i < nums1.length and 0 <= j < nums2.length, is valid if both i <= j and nums1[i] <= nums2[j]. The distance of the pair is j - i.
Find and provide the largest distance of any valid pair (i, j). If there are no valid pairs, provide 0.
An array arr is non-increasing if arr[i-1] >= arr[i] for every 1 <= i < arr.length.
Input: nums1 = [55,30,5,4,2], nums2 = [100,20,10,10,5]
Output: 2
Explanation: The valid pairs are (0,0), (2,2), (2,3), (2,4), (3,3), (3,4), and (4,4).
The largest distance is 2 with pair (2,4).
Input: nums1 = [2,2,2], nums2 = [10,10,1]
Output: 1
Explanation: The valid pairs are (0,0), (0,1), and (1,1).
The largest distance is 1 with pair (0,1).
Input: nums1 = [30,29,19,5], nums2 = [25,25,25,25,25]
Output: 2
Explanation: The valid pairs are (2,2), (2,3), (2,4), (3,3), and (3,4).
The largest distance is 2 with pair (2,4).
Constraints
1 <= nums1.length, nums2.length <= 10^51 <= nums1[i], nums2[j] <= 10^5- Both
nums1andnums2are non-increasing.
Did this problem appear in one of your interviews?
Responses stay private.