I am unable to figure out the approach of this question
Unlock-approach
Please add the problem link.
Can you please mention the problem’s exact name also.
I have placed this doubt in Unlock question problem
Please at the problem link that is public and available, or atleast copy paste the problem. I am not able to find it by just the name.
Shekhar is a bomb defusal specialist. He once encountered a bomb that can be defused only by a secret code. He is given a number N and a number K. And he is also given permutation of first N natural numbers . The defusal code is the largest permutation possible by doing exactly K swaps among a pair of the given permutation. Help him to find the final permutation.
This the problem statement of the question: