https://www.hackerrank.com/challenges/minimum-swaps-2/problem

minimum-swaps-2.java

static int minimumSwaps(int[] arr) {
    if (arr.length == 1) {
        return 0;
    }

    int swapCount = 0;
    int temp;
    for (int i = 1; i <= arr.length; i++) {
        if (i != arr[i-1]) {                
            temp = arr[i-1];
            arr[i-1] = arr[temp-1];
            arr[temp-1] = temp;                
            swapCount++;
            i--;
        }
    }

    return swapCount;
}