This query is from, div 2 c of codeforces however with just a little change
*** There are 2 strings, string A & string B . that accommodates lowercase letters , and we’ve to seek out all of the minimal operations to make them equal;

operation:

choose indexes i,j from string A and string B, then swap letters at positions i and j

additionally we have to inform the sequences of operations
Assume it’s all the time equal to make them equal.

Is there any constructive technique to do it ?
I’ve one building that may lead me to consequence however undecided if we will do it that manner .

I would like some opinions on this downside,

unique downside hyperlink