Minimum Swaps 2

Given an array of integers A of size N that is a permutation of [0, 1, 2, …, (N-1)].
It is allowed to swap any two elements (not necessarily consequtive).

Find the minimum number of swaps required to sort the array in ascending order.

Input Format

The only argument given is the integer array A.

Output Format

Return the minimum number of swaps.


1 <= N <= 100000
0 <= A[i] < N

For Example

Input 1:
    A = [1, 2, 3, 4, 0]
Output 1:

Input 2:
    A = [2, 0, 1, 3]
Output 2:
NOTE: You only need to implement the given function. Do not read input, instead use the arguments to the function. Do not print the output, instead return values as specified. Still have a doubt? Checkout Sample Codes for more details.
Start solving Minimum Swaps 2 on Interview Code Editor
Sign Up
to access hints and editorial solutions for Minimum Swaps 2


Click here to start solving coding interview questions