3151. Special Array I - Explanation

1. Modulo Comparision

class Solution:
    def isArraySpecial(self, nums: List[int]) -> bool:
        for i in range(1, len(nums)):
            if nums[i - 1] % 2 == nums[i] % 2:
                return False
        return True

Time & Space Complexity

Time complexity: $O(n)$
Space complexity: $O(1)$

2. Bitwise Comparision

class Solution:
    def isArraySpecial(self, nums: List[int]) -> bool:
        for i in range(1, len(nums)):
            if nums[i - 1] & 1 == nums[i] & 1:
                return False
        return True

Time & Space Complexity

Time complexity: $O(n)$
Space complexity: $O(1)$