Skip to content

Practice Count Alternating Subarrays

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3101
LeetCode Problem

Count Alternating Subarrays

Problem Statement

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.

Source: Count Alternating Subarrays on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [0,1,1,1]
Output
5

# Example 2

Input
nums = [1,0,1,0]
Output
10

Constraints

1 <= nums.length <= 10^5
nums[i] is either 0 or 1.

Related LeetCode Problems

Practice more problems similar to Count Alternating Subarrays.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.