Leetcode 1855. Maximum Distance Between a Pair of Values

Given two non-increasing arrays, find the maximum index distance j - i for a pair (i, j) with i <= j and nums1[i] <= nums2[j]; the monotonicity of both arrays lets you efficiently search valid pairs (e.g., via two pointers or binary search) for lengths up to 1e5.