src/main/java/com/fishercoder/solutions/_1385.java

package com.fishercoder.solutions;

public class _1385 {
    public static class Solution1 {
        public int findTheDistanceValue(int[] arr1, int[] arr2, int d) {
            int count = 0;
            for (int i = 0; i < arr1.length; i++) {
                int j = 0;
                for (; j < arr2.length; j++) {
                    if (Math.abs(arr1[i] - arr2[j]) <= d) {
                        break;
                    }
                }
                if (j == arr2.length) {
                    count++;
                }
            }
            return count;
        }
    }
}