Given a number M (N-digit integer) and K-swap operations(a swap operation can swap 2 digits), devise an algorithm to get the maximum possible integer? #Google #Interview #Question

Kswap.cpp

#include <iostream>
using namespace std;
/*
   Approach - Selection sort descending order
*/
int Kswap(int num, int k)
{
    
    
    string arr = to_string(num);
    int i, j, min_idx;
    int n =arr.length();
    // One by one move boundary of unsorted subarray
    for (i = 0; i < k; i++)
    {
        // Find the max element in unsorted array
        min_idx = i;
        for (j = i+1; j < n; j++)
          if (arr[j] > arr[min_idx])
            min_idx = j;
 
        // Swap the found max element with the first element
        swap(arr[min_idx], arr[i]);
    }
    
    
    int ans = stoi(arr);
    return ans;
}
 

int main() {
	// your code goes here
	cout<<Kswap(254,2)<<endl;
	cout<<Kswap(132,1)<<endl;
	cout<<Kswap(132,2)<<endl;
	
	return 0;
}