Add solution #1534

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,290 LeetCode solutions in JavaScript
+# 1,291 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -1114,6 +1114,7 @@
 1519|[Number of Nodes in the Sub-Tree With the Same Label](./solutions/1519-number-of-nodes-in-the-sub-tree-with-the-same-label.js)|Medium|
 1524|[Number of Sub-arrays With Odd Sum](./solutions/1524-number-of-sub-arrays-with-odd-sum.js)|Medium|
 1528|[Shuffle String](./solutions/1528-shuffle-string.js)|Easy|
+1534|[Count Good Triplets](./solutions/1534-count-good-triplets.js)|Easy|
 1535|[Find the Winner of an Array Game](./solutions/1535-find-the-winner-of-an-array-game.js)|Medium|
 1550|[Three Consecutive Odds](./solutions/1550-three-consecutive-odds.js)|Easy|
 1551|[Minimum Operations to Make Array Equal](./solutions/1551-minimum-operations-to-make-array-equal.js)|Medium|

solutions/1534-count-good-triplets.js

@@ -0,0 +1,37 @@
+/**
+ * 1534. Count Good Triplets
+ * https://leetcode.com/problems/count-good-triplets/
+ * Difficulty: Easy
+ *
+ * Given an array of integers arr, and three integers a, b and c. You need to find the number
+ * of good triplets.
+ *
+ * A triplet (arr[i], arr[j], arr[k]) is good if the following conditions are true:
+ * - 0 <= i < j < k < arr.length
+ * - |arr[i] - arr[j]| <= a
+ * - |arr[j] - arr[k]| <= b
+ * - |arr[i] - arr[k]| <= c
+ *
+ * Where |x| denotes the absolute value of x.
+ *
+ * Return the number of good triplets.
+ */
+
+function countGoodTriplets(arr, a, b, c) {
+  const length = arr.length;
+  let result = 0;
+
+  for (let i = 0; i < length - 2; i++) {
+    for (let j = i + 1; j < length - 1; j++) {
+      if (Math.abs(arr[i] - arr[j]) <= a) {
+        for (let k = j + 1; k < length; k++) {
+          if (Math.abs(arr[j] - arr[k]) <= b && Math.abs(arr[i] - arr[k]) <= c) {
+            result++;
+          }
+        }
+      }
+    }
+  }
+
+  return result;
+}