Available question text
Count how many elements in arr1 have no element in arr2 within distance d (i.e., for which every |arr1[i] - arr2[j]| > d). Arrays are small (<=500), so this reduces to checking each arr1 value against all arr2 values (or faster via sorting + binary search).
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1385. Find the Distance Value Between Two Arrays
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source