https://leetcode.com/problems/k-similar-strings/\nThere are two anagram strings, what is the minimum number of swaps required to match one string to another? You can swap any 2 characters. What is time complexity?\n\n**Example 1:**\n```\nInput: s1 = "AABC", s2 = "AACB"\nOutput: 1\nExplanation: swap \'B\' and \'C\' AABC => AACB\n```

https://leetcode.com/problems/k-similar-strings/\nThere are two anagram strings, what is the minimum number of swaps required to match one string to another? Yo