{ "id": 3483, "name": "alternating-groups-ii", "difficulty": "Medium", "link": "https://leetcode.com/problems/alternating-groups-ii/", "date": "2024-06-22", "task_description": "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 <= 105` `0 <= colors[i] <= 1` `3 <= k <= colors.length`", "test_case": [ { "label": "Example 1", "input": "colors = [0,1,0,1,0], k = 3", "output": "3 " }, { "label": "Example 2", "input": "colors = [0,1,0,0,1,0,1], k = 6", "output": "2 " }, { "label": "Example 3", "input": "colors = [1,1,0,1], k = 4", "output": "0 " } ], "constraints": [ "colors[i] == 0 means that tile i is red.", "colors[i] == 1 means that tile i is blue.", "3 <= colors.length <= 105", "0 <= colors[i] <= 1", "3 <= k <= colors.length" ], "python_template": "class Solution(object):\n def numberOfAlternatingGroups(self, colors, k):\n \"\"\"\n :type colors: List[int]\n :type k: int\n :rtype: int\n \"\"\"\n ", "java_template": "class Solution {\n public int numberOfAlternatingGroups(int[] colors, int k) {\n \n }\n}", "metadata": { "func_name": "numberOfAlternatingGroups" } }