there are two more variation for this problem :
Find minimum integer possible by doing at-least K swap operations on its digits.
Find maximum/minimum integer possible by doing exactly K swap operations on its digits.
Please help me to understand the concept.Not able to get it from the gfg tutorial.