.png&w=3840&q=75)
Akshit Suthar
4/19/2026 · 17 views
This problem () asks you to find the maximum distance j - i such that:
i <= jnums1[i] <= nums2[j]Since both arrays are sorted in descending order, you can use a two-pointer approach:
i = 0 and j = 0nums1[i] <= nums2[j], it's valid → update answer and move j++ (try to increase distance)i++ (need a smaller value in nums1)This works in O(n + m) time.
Sign in to join the conversation
Sign inUrl = https://leetcode.com/problems/maximum-distance-between-a-pair-of-values/
#include <vector>
#include <algorithm>
using namespace std;
class Solution {
public:
int maxDistance(vector<int>& nums1, vector<int>& nums2) {
int i = 0, j = 0;
int n = nums1.size(), m = nums2.size();
int maxDist = 0;
while (i < n && j < m) {
if (nums1[i] <= nums2[j]) {
maxDist = max(maxDist, j - i);
j++; // try to expand distance
} else {
i++; // need smaller nums1[i]
}
}
return maxDist;
}
};