[Solution] Minimum number of Flips CodeChef Solution | CodeChef Problem Solution 2022

[Solution] Minimum number of Flips CodeChef Solution | CodeChef Problem Solution 2022

Chef has an array A$A$ of length N$N$ consisting of 1$1$ and −1$-1$ only.

In one operation, Chef can choose any index i$i$ (1≤i≤N)$(1\le i\le N)$ and multiply the element Ai$A_i$ by −1$-1$.

Find the minimum number of operations required to make the sum of the array equal to 0$0$. Output -1 if the sum of the array cannot be made 0$0$.

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.

Solution Click Below:-  CLICK HERE

• First line of each test case consists of a single integer N$N$ denoting the length of the array.
• Second line of each test case contains N$N$ space-separated integers A1,A2,…,AN$A_1,A_2,\dots ,A_N$ denoting the array A$A$.

Output Format

For each test case, output the minimum number of operations to make the sum of the

Age Limit Codechef Solution

Equal Distribution Codechef Solution

Minimum number of Flips CodeChef Solution

Divisible by 3 CodeChef Solution

How Many Maximums CodeChef Solution

Minimum or Maximum CodeChef Solution 

Maximise Set Bits CodeChef Solution

Sorting Array CodeChef Solution

Construct An Array CodeChef Solution

 array equal to 0$0$. Output -1 if it is not possible to make the sum equal to 0$0$.

Constraints

• 1≤T≤100$1\le T\le 100$
• 2≤N≤1000$2\le N\le 1000$