Add solution #1385

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,268 LeetCode solutions in JavaScript
+# 1,269 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1055,6 +1055,7 @@
 1381|[Design a Stack With Increment Operation](./solutions/1381-design-a-stack-with-increment-operation.js)|Medium|
 1382|[Balance a Binary Search Tree](./solutions/1382-balance-a-binary-search-tree.js)|Medium|
 1383|[Maximum Performance of a Team](./solutions/1383-maximum-performance-of-a-team.js)|Hard|
+1385|[Find the Distance Value Between Two Arrays](./solutions/1385-find-the-distance-value-between-two-arrays.js)|Easy|
 1389|[Create Target Array in the Given Order](./solutions/1389-create-target-array-in-the-given-order.js)|Easy|
 1400|[Construct K Palindrome Strings](./solutions/1400-construct-k-palindrome-strings.js)|Medium|
 1402|[Reducing Dishes](./solutions/1402-reducing-dishes.js)|Hard|

solutions/1385-find-the-distance-value-between-two-arrays.js

@@ -0,0 +1,34 @@
+/**
+ * 1385. Find the Distance Value Between Two Arrays
+ * https://leetcode.com/problems/find-the-distance-value-between-two-arrays/
+ * Difficulty: Easy
+ *
+ * Given two integer arrays arr1 and arr2, and the integer d, return the distance value between
+ * the two arrays.
+ *
+ * The distance value is defined as the number of elements arr1[i] such that there is not any
+ * element arr2[j] where |arr1[i]-arr2[j]| <= d.
+ */
+
+/**
+ * @param {number[]} arr1
+ * @param {number[]} arr2
+ * @param {number} d
+ * @return {number}
+ */
+var findTheDistanceValue = function(arr1, arr2, d) {
+  let result = 0;
+
+  for (const num1 of arr1) {
+    let isValid = true;
+    for (const num2 of arr2) {
+      if (Math.abs(num1 - num2) <= d) {
+        isValid = false;
+        break;
+      }
+    }
+    if (isValid) result++;
+  }
+
+  return result;
+};