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]| <=$ d.

Constraints:

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

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

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

Let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding on how to solve this problem.

Implement your solution in the following coding playground.