Add solution #3392

Author: JoshCrozier

README.md

@@ -361,6 +361,7 @@
 2490|[Circular Sentence](./2490-circular-sentence.js)|Easy|
 2529|[Maximum Count of Positive Integer and Negative Integer](./2529-maximum-count-of-positive-integer-and-negative-integer.js)|Easy|
 2535|[Difference Between Element Sum and Digit Sum of an Array](./2535-difference-between-element-sum-and-digit-sum-of-an-array.js)|Easy|
+3392|[Count Subarrays of Length Three With a Condition](./3392-count-subarrays-of-length-three-with-a-condition.js)|Easy|
 3396|[Minimum Number of Operations to Make Elements in Array Distinct](./3396-minimum-number-of-operations-to-make-elements-in-array-distinct.js)|Easy|
 3397|[Maximum Number of Distinct Elements After Operations](./3397-maximum-number-of-distinct-elements-after-operations.js)|Medium|
 3402|[Minimum Operations to Make Columns Strictly Increasing](./3402-minimum-operations-to-make-columns-strictly-increasing.js)|Easy|

solutions/3392-count-subarrays-of-length-three-with-a-condition.js

@@ -0,0 +1,22 @@
+/**
+ * 3392. Count Subarrays of Length Three With a Condition
+ * https://leetcode.com/problems/count-subarrays-of-length-three-with-a-condition/
+ * Difficulty: Easy
+ *
+ * Given an integer array nums, return the number of subarrays of length 3 such that
+ * the sum of the first and third numbers equals exactly half of the second number.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {number}
+ */
+var countSubarrays = function(nums) {
+  let count = 0;
+  for (let i = 0; i < nums.length - 2; i++) {
+    if (nums[i] + nums[i + 2] === nums[i + 1] / 2) {
+      count++;
+    }
+  }
+  return count;
+};