Watch 10 video solutions for Count Alternating Subarrays, a medium level problem involving Array, Math. This walkthrough by NeetCodeIO has 18,200 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
You are given a binary array nums.
We call a subarray alternating if no two adjacent elements in the subarray have the same value.
Return the number of alternating subarrays in nums.
Example 1:
Input: nums = [0,1,1,1]
Output: 5
Explanation:
The following subarrays are alternating: [0], [1], [1], [1], and [0,1].
Example 2:
Input: nums = [1,0,1,0]
Output: 10
Explanation:
Every subarray of the array is alternating. There are 10 possible subarrays that we can choose.
Constraints:
1 <= nums.length <= 105nums[i] is either 0 or 1.