Special Array I - Leetcode 3151 | Multiple Approaches | Modulo Operator | Bitwise Xor

Problem Description

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.

Problem: https://leetcode.com/problems/special-array-i/
Code link: https://k5kc.com/cs/problems/special-array-1/

Видео Special Array I - Leetcode 3151 | Multiple Approaches | Modulo Operator | Bitwise Xor канала Code With K5KC