{
  "id": 3527,
  "name": "alternating-groups-iii",
  "difficulty": "Hard",
  "link": "https://leetcode.com/problems/alternating-groups-iii/",
  "date": "2024-07-28",
  "task_description": "There are some red and blue tiles arranged circularly. You are given an array of integers `colors` and a 2D integers array `queries`. 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 a contiguous subset of tiles in the circle with **alternating** colors (each tile in the group except the first and last one has a different color from its adjacent tiles in the group). You have to process queries of two types: `queries[i] = [1, sizei]`, determine the count of **alternating** groups with size `sizei`. `queries[i] = [2, indexi, colori]`, change `colors[indexi]` to `colori`. Return an array `answer` containing the results of the queries of the first type _in order_. **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,1,0,1], queries = [[2,1,0],[1,4]] **Output:** [2] **Explanation:** **** First query: Change `colors[1]` to 0. Second query: Count of the alternating groups with size 4: **Example 2:** **Input:** colors = [0,0,1,0,1,1], queries = [[1,3],[2,3,0],[1,5]] **Output:** [2,0] **Explanation:** First query: Count of the alternating groups with size 3: Second query: `colors` will not change. Third query: There is no alternating group with size 5. **Constraints:** `4 <= colors.length <= 5 * 104` `0 <= colors[i] <= 1` `1 <= queries.length <= 5 * 104` `queries[i][0] == 1` or `queries[i][0] == 2` For all `i` that: `queries[i][0] == 1`: `queries[i].length == 2`, `3 <= queries[i][1] <= colors.length - 1` `queries[i][0] == 2`: `queries[i].length == 3`, `0 <= queries[i][1] <= colors.length - 1`, `0 <= queries[i][2] <= 1`",
  "test_case": [
    {
      "label": "Example 1",
      "input": "colors = [0,1,1,0,1], queries = [[2,1,0],[1,4]]",
      "output": "[2] "
    },
    {
      "label": "Example 2",
      "input": "colors = [0,0,1,0,1,1], queries = [[1,3],[2,3,0],[1,5]]",
      "output": "[2,0] "
    }
  ],
  "constraints": [
    "colors[i] == 0 means that tile i is red.",
    "colors[i] == 1 means that tile i is blue.",
    "queries[i] = [1, sizei], determine the count of alternating groups with size sizei.",
    "queries[i] = [2, indexi, colori], change colors[indexi] to colori.",
    "4 <= colors.length <= 5 * 104",
    "0 <= colors[i] <= 1",
    "1 <= queries.length <= 5 * 104",
    "queries[i][0] == 1 or queries[i][0] == 2",
    "For all i that:\n\t\nqueries[i][0] == 1: queries[i].length == 2, 3 <= queries[i][1] <= colors.length - 1\nqueries[i][0] == 2: queries[i].length == 3, 0 <= queries[i][1] <= colors.length - 1, 0 <= queries[i][2] <= 1",
    "queries[i][0] == 1: queries[i].length == 2, 3 <= queries[i][1] <= colors.length - 1",
    "queries[i][0] == 2: queries[i].length == 3, 0 <= queries[i][1] <= colors.length - 1, 0 <= queries[i][2] <= 1",
    "queries[i][0] == 1: queries[i].length == 2, 3 <= queries[i][1] <= colors.length - 1",
    "queries[i][0] == 2: queries[i].length == 3, 0 <= queries[i][1] <= colors.length - 1, 0 <= queries[i][2] <= 1"
  ],
  "python_template": "class Solution(object):\n    def numberOfAlternatingGroups(self, colors, queries):\n        \"\"\"\n        :type colors: List[int]\n        :type queries: List[List[int]]\n        :rtype: List[int]\n        \"\"\"\n        ",
  "java_template": "class Solution {\n    public List<Integer> numberOfAlternatingGroups(int[] colors, int[][] queries) {\n        \n    }\n}",
  "metadata": {
    "func_name": "numberOfAlternatingGroups"
  }
}