Add 3151_special_array_one

m3xw3ll · m3xw3ll · commit 2ecb0d53c9ad · 2025-03-22T17:27:44.000+01:00
diff --git a/Algorithms/3151_special_array_one.md b/Algorithms/3151_special_array_one.md
@@ -0,0 +1,46 @@
+# [Special Array I](https://leetcode.com/problems/special-array-i/description/)
+
+An array is considered special if the parity of every pair of adjacent elements is different. In other words, one element in each pair must be even, and the other must be odd.
+
+You are given an array of integers nums. Return true if nums is a special array, otherwise, return false.
+
+Example 1:
+```
+Input: nums = [1]
+
+Output: true
+
+Explanation:
+
+There is only one element. So the answer is true.
+```
+Example 2:
+```
+Input: nums = [2,1,4]
+
+Output: true
+
+Explanation:
+
+There is only two pairs: (2,1) and (1,4), and both of them contain numbers with different parity. So the answer is true.
+```
+Example 3:
+```
+Input: nums = [4,3,1,6]
+
+Output: false
+
+Explanation:
+
+nums[1] and nums[2] are both odd. So the answer is false.
+```
+Solution
+```python
+class Solution:
+    def isArraySpecial(self, nums: List[int]) -> bool:
+        for i in range(len(nums) - 1):
+            if nums[i] % 2 == nums[i+1] % 2:
+                return False
+        return True
+```
+
diff --git a/Algorithms/snippets/3151_special_array_one.py b/Algorithms/snippets/3151_special_array_one.py
@@ -0,0 +1,8 @@
+def is_array_special(nums):
+    for i in range(len(nums) - 1):
+        if nums[i] % 2 == nums[i+1] % 2:
+            return False
+    return True
+
+
+print(is_array_special([4,3,1,6]))
diff --git a/README.md b/README.md
@@ -757,6 +757,7 @@ To search for a specific problem please use ```STRG + F``` to search for.
 | 3099   | [Harshad Number](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3099_harshad_number.md)
 | 3110   | [Score of a String](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3110_score_of_a_string.md)
 | 3131   | [Find the Integer Added to Array I](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3131_find_the_integer_added_to_array_one.md)
+| 3151   | [Special Array I](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3151_special_array_one.md)
 | 3162   | [Find the Number of Good Pairs I](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3162_find_the_number_of_good_pairs_one.md)
 | 3174   | [Clear Digits](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3174_clear_digits.md)
 | 3190   | [Find Minimum Operations to Make All Elements Divisible by Three](https://github.com/m3xw3ll/LeetCode/blob/master/Algorithms/3190_find_minimum_operations_to_make_all_elements_divisible_by_three.md)
