There is a circle of red and blue tiles. You are given an array of integers colors and an integer k. The color of tile i is represented by colors[i]:
colors[i] == 0 means that tile i is red.colors[i] == 1 means that tile i is blue.An alternating group is every k contiguous tiles in the circle with alternating colors (each tile in the group except the first and last one has a different color from its left and right tiles).
Return the number of alternating groups.
Note that since colors represents a circle, the first and the last tiles are considered to be next to each other.
Example 1:
Input: colors = [0,1,0,1,0], k = 3
Output: 3
Explanation:
Alternating groups:
Example 2:
Input: colors = [0,1,0,0,1,0,1], k = 6
Output: 2
Explanation:
Alternating groups:
Example 3:
Input: colors = [1,1,0,1], k = 4
Output: 0
Explanation:
Constraints:
3 <= colors.length <= 1050 <= colors[i] <= 13 <= k <= colors.lengthSolutions for this problem are being prepared.
Try solving it yourselfAlternating Groups II - Leetcode 3208 - Python • NeetCodeIO • 10,164 views views
Watch 9 more video solutions →Practice Alternating Groups II with our built-in code editor and test cases.
Practice on FleetCodePractice this problem
Open in Editor