Tap here to switch tabs
Problem
Submissions

Problem: Find the Distance Value Between Two Arrays

Find the Distance Value Between Two Arrays asks you to count elements in the first integer array that have no element in the second within a given distance.

Statement

You are given two integer arrays, arr1 and arr2, along with an integer d. Your task is to find and return the distance value between these arrays.

Note: The distance value is defined as the count of elements in arr1 for which there is no element in arr2 such that ∣arr1[i]−arr2[j]∣<=|arr1[i]-arr2[j]| <= d.

Constraints:

  • 1<=1 <= arr1.length, arr2.length <=500 <= 500

  • −1000<=-1000 <= arr1[i], arr2[j] <=1000<= 1000

  • 0<=0 <= d <=100<= 100

⋮
Tap here to switch tabs
Problem
Submissions

Problem: Find the Distance Value Between Two Arrays

Find the Distance Value Between Two Arrays asks you to count elements in the first integer array that have no element in the second within a given distance.

Statement

You are given two integer arrays, arr1 and arr2, along with an integer d. Your task is to find and return the distance value between these arrays.

Note: The distance value is defined as the count of elements in arr1 for which there is no element in arr2 such that ∣arr1[i]−arr2[j]∣<=|arr1[i]-arr2[j]| <= d.

Constraints:

  • 1<=1 <= arr1.length, arr2.length <=500 <= 500

  • −1000<=-1000 <= arr1[i], arr2[j] <=1000<= 1000

  • 0<=0 <= d <=100<= 100