we have the constraints
1 <= n <= 10^5 1<= K <= 10^9
how can be the K > n ?
Unlock problem constraints
K can be any number of swaps. May be greater than n.
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.