# Find The Distance Value Between Two Arrays: Walkthrough
Find The Distance Value Between Two Arrays shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.
## Key idea
The distance value is how many arr1[i] have no arr2[j] with |arr1[i]-arr2[j]| <= d. Sort arr2 and binary-search the closest value to each arr1[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) log m).
## Common mistake
Checking only equality, or using a linear scan of arr2 for every i when m is large.
## 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 Linkjob AI.