Add solution #3151

Author: JoshCrozier

README.md

@@ -538,6 +538,7 @@
 2948|[Make Lexicographically Smallest Array by Swapping Elements](./2948-make-lexicographically-smallest-array-by-swapping-elements.js)|Medium|
 3042|[Count Prefix and Suffix Pairs I](./3042-count-prefix-and-suffix-pairs-i.js)|Easy|
 3110|[Score of a String](./3110-score-of-a-string.js)|Easy|
+3151|[Special Array I](./3151-special-array-i.js)|Easy|
 3223|[Minimum Length of String After Operations](./3223-minimum-length-of-string-after-operations.js)|Medium|
 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|

solutions/3151-special-array-i.js

@@ -0,0 +1,24 @@
+/**
+ * 3151. Special Array I
+ * https://leetcode.com/problems/special-array-i/
+ * Difficulty: Easy
+ *
+ * An array is considered special if every pair of its adjacent elements contains
+ * two numbers with different parity.
+ *
+ * You are given an array of integers nums. Return true if nums is a special array,
+ * otherwise, return false.
+ */
+
+/**
+ * @param {number[]} nums
+ * @return {boolean}
+ */
+var isArraySpecial = function(nums) {
+  for (let i = 0; i < nums.length - 1; i++) {
+    if ((nums[i] + nums[i + 1]) % 2 === 0) {
+      return false;
+    }
+  }
+  return true;
+};