Valid Pairing of Numbers

Hard
0/120
Average time to solve is 50m

Problem statement

You are provided with a list of numbers from ‘0’ to (2 * ’N’ - 1). You have to find the minimum number of swaps needed to make every even number ‘E’ (present in the list) adjacent to (‘E’ + 1).

For Example:
``````List = [3, 0, 2, 1]

We have to make ‘0’ adjacent to ‘1’ and ‘2’ to ‘3’. And, to achieve this we can swap ‘0’ with ‘2’.

New list = [3, 2, 0, 1].

Therefore, the answer (minimum number of swaps) is equal to 1.
``````
Note:
``````There will be only distinct numbers present in the given list.
``````
Detailed explanation ( Input/output format, Notes, Images )
Constraints:
``````1 <= T <= 10
1 <= N <= 100
0 <= ARR[ i ] < 2 * N

Time limit: 1 sec
``````
Sample Input 1:
``````1
2
3 0 2 1
``````
Sample Output 1:
``````1
``````
Explanation of sample input 1:
``````For the first test case, an explanation is given in the description.
``````
Sample Input 2:
``````2
1
1 0
3
1 0 2 3 5 4
``````
Sample Output 2:
``````0
0
``````
Explanation for sample input 2:
``````In the first test case, the required pairing of all the even numbers is already done.

In the second test case, the required pairing of all the even numbers is already done.
``````
Console