# Maximum Distance Between A Pair Of Values: Practice Notes

Maximum Distance Between A Pair Of Values shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Two non-increasing arrays. A valid pair (i, j) has i <= j and nums1[i] <= nums2[j]; maximize j - i. Two pointers: start i = j = 0 and walk j through nums2; advance i while nums1[i] > nums2[j], then update the answer with j - i.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

O(n+m).

## Common mistake

Treating the arrays as increasing (the inequality direction flips) or using a nested scan (too slow, and unnecessary given monotonicity).

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI help for online coding assessments.