Different elements You are given an array A of size N. You can change any array...

Transcribed Image Text:

Different elements You are given an array A of size N. You can change any array element to any other integer in one operation. Determine the minimum number of operations that are required such that no two adjacent elements are equal. Input format • The first line contains T denoting the number of test cases. • The first line of each test case contains a single integer N. . The second line of each test case contains N space- separated integers denoting the elements of the array. Output format For each test case, print the minimum number of operations M Output format For each test case, print the minimum number of operations required in a new line. Constraints 1≤T≤ 100 1≤N≤ 100000 1≤A, < 100000 Sample input E 3 6 Sample output 3 1 Different elements You are given an array A of size N. You can change any array element to any other integer in one operation. Determine the minimum number of operations that are required such that no two adjacent elements are equal. Input format • The first line contains T denoting the number of test cases. • The first line of each test case contains a single integer N. . The second line of each test case contains N space- separated integers denoting the elements of the array. Output format For each test case, print the minimum number of operations M Output format For each test case, print the minimum number of operations required in a new line. Constraints 1≤T≤ 100 1≤N≤ 100000 1≤A, < 100000 Sample input E 3 6 Sample output 3 1