We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Minimum Swaps 2
  2. Discussions

Minimum Swaps 2

  • grsoratoor
     + 1 comment

    This code solves all the test cases , even if it contains consecutive integers

    int minimumSwaps(vector<int> arr) {
    int len = arr.size();
    int count = 0; 
    for(int i = 0;i<len;i++)
    {
        if(arr[i] != i+1 && arr[i]<=len)
        {
          swap(arr[i],arr[arr[i]-1]);
          count++;
          i--;
        }
    }     
    return count;
}