There is a circle of red and blue tiles. You are given an array of integers colors. 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.Every 3 contiguous tiles in the circle with alternating colors (the middle tile has a different color from its left and right tiles) is called an alternating group.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 = [1,1,1]Output: 0Explanation:Example 2:Input: colors = [0,1,0,0,1]Output: 3Explanation:Alternating groups: Constraints:3 <= colors.length <= 1000 <= colors[i] <= 1

Given an array nums with n objects colored red, white, or blue, sort them in-place so that objects of the same color are adjacent, with the colors in the order red, white, and blue.We will use the integers 0, 1, and 2 to represent the color red, white, and blue, respectively.You must solve this problem without using the library's sort function.

Given an array that represents sock colors: Sock_colors = [3,3,2,1,1,3,5,1,4,2], how many pairs of the same color socks exist?1 point324

Given an array of N positive integers, print the positive integers that have both the adjacent element values as odd or even.Boundary Condition(s):3 <= N <= 1000Input Format:The first line contains N.The second line contains N elements separated by space(s).Output Format:The first line contains the elements (which have both the adjacent element values as odd or even) separated by a space.Example Input/Output 1:Input:710 21 20 33 98 66 29Output:21 20 33Example Input/Output 2:Input:511 21 30 99 52Output:30 99

You are given an integer limit and a 2D array queries of size n x 2.There are limit + 1 balls with distinct labels in the range [0, limit]. Initially, all balls are uncolored. For every query in queries that is of the form [x, y], you mark ball x with the color y. After each query, you need to find the number of distinct colors among the balls.Return an array result of length n, where result[i] denotes the number of distinct colors after ith query.Note that when answering a query, lack of a color will not be considered as a color. Example 1:Input: limit = 4, queries = [[1,4],[2,5],[1,3],[3,4]]Output: [1,2,2,3]Explanation:After query 0, ball 1 has color 4.After query 1, ball 1 has color 4, and ball 2 has color 5.After query 2, ball 1 has color 3, and ball 2 has color 5.After query 3, ball 1 has color 3, ball 2 has color 5, and ball 3 has color 4.Example 2:Input: limit = 4, queries = [[0,1],[1,2],[2,2],[3,4],[4,5]]Output: [1,2,2,3,4]Explanation:After query 0, ball 0 has color 1.After query 1, ball 0 has color 1, and ball 1 has color 2.After query 2, ball 0 has color 1, and balls 1 and 2 have color 2.After query 3, ball 0 has color 1, balls 1 and 2 have color 2, and ball 3 has color 4.After query 4, ball 0 has color 1, balls 1 and 2 have color 2, ball 3 has color 4, and ball 4 has color 5. Constraints:1 <= limit <= 1091 <= n == queries.length <= 105queries[i].length == 20 <= queries[i][0] <= limit1 <= queries[i][1] <= 109

onsider the following 8-puzzle problem, answer the questions below.(i)           Draw state space for solving the above 8-puzzle.(ii) Suppose we define heuristic function for this problem as the number of tiles, which are out of place at a given state. For example, in the initial state the tiles 2, 8, 1, 6, 7 are in out of place. Therefore, h(initial) = 5.   And g(n) is defined as the number of levels passed in the state space, g(initial) = 0 By defining f(n) = g(n) + h(n), calculate f(n) for each node in the state space. Hence find the traversal for exploring the state space by the following algorithms. (a) Greedy Search(b) A* Search