Code360 powered by Coding Ninjas X Naukri.com. Code360 powered by Coding
Ninjas X Naukri.com

Problem of the day

You have been given an array 'ARR' of 'N' distinct elements.

Your task is to find the minimum no. of swaps required to sort the array.

```
For the given input array [4, 3, 2, 1], the minimum no. of swaps required to sort the array is 2, i.e. swap index 0 with 3 and 1 with 2 to form the sorted array [1, 2, 3, 4].
```

Detailed explanation

```
1 <= T <= 100
1 <= N <= 1000
0 <= ARR[i] <= 10 ^ 9
Where 'ARR[i]' is the value of the input array elements.
Time Limit: 1 sec
```

```
2
4
4 3 2 1
5
1 5 4 3 2
```

```
2
2
```

```
For the first test case, swap index 0 with 3 i.e. 4 -> 1 and 1 with 2 i.e. 3 -> 2 to form the sorted array {1, 2, 3, 4}.
For the second test case, swap index 1 with 4 i.e. 5 -> 2 and 2 with 3 i.e. 4 -> 3 to form the sorted array {1, 2, 3, 4, 5}.
```

```
2
4
1 2 3 4
6
3 5 2 4 6 8
```

```
0
3
```