Added test

Author: javadev

src/main/java/g3201_3300/s3245_alternating_groups_iii/Solution.java

@@ -109,10 +109,6 @@ private int processQueryType1(int[] colors, TreeMap<Integer, Integer> groups, in
                 ans -= Math.max(rightLen - groupSize + 1, 0);
                 ans += Math.max(leftLen + rightLen - groupSize + 1, 0);
             }
-        } else if (colors[0] != colors[colors.length - 1]) {
-            // In the special case when there's a single group but the
-            // first and last colors differ, the whole array is counted.
-            ans = colors.length;
         }
         return ans;
     }

src/test/java/g3201_3300/s3245_alternating_groups_iii/SolutionTest.java

@@ -25,4 +25,14 @@ void numberOfAlternatingGroups2() {
                                 new int[][] {{1, 3}, {2, 3, 0}, {1, 5}}),
                 equalTo(List.of(2, 0)));
     }
+
+    @Test
+    void numberOfAlternatingGroups3() {
+        assertThat(
+                new Solution()
+                        .numberOfAlternatingGroups(
+                                new int[] {0, 0, 0, 1},
+                                new int[][] {{2, 1, 1}, {1, 3}, {2, 1, 1}, {2, 0, 1}}),
+                equalTo(List.of(4)));
+    }
 }