<p>Strings <code>s1</code> and <code>s2</code> are <code>k</code><strong>-similar</strong> (for some non-negative integer <code>k</code>) if we can swap the positions of two letters in <code>s1</code> exactly <code>k</code> times so that the resulting string equals <code>s2</code>.</p>

<p>Given two anagrams <code>s1</code> and <code>s2</code>, return the smallest <code>k</code> for which <code>s1</code> and <code>s2</code> are <code>k</code><strong>-similar</strong>.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> s1 = &quot;ab&quot;, s2 = &quot;ba&quot;
<strong>Output:</strong> 1
<strong>Explanation:</strong> The two string are 1-similar because we can use one swap to change s1 to s2: &quot;ab&quot; --&gt; &quot;ba&quot;.
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> s1 = &quot;abc&quot;, s2 = &quot;bca&quot;
<strong>Output:</strong> 2
<strong>Explanation:</strong> The two strings are 2-similar because we can use two swaps to change s1 to s2: &quot;abc&quot; --&gt; &quot;bac&quot; --&gt; &quot;bca&quot;.
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>1 &lt;= s1.length &lt;= 20</code></li>
	<li><code>s2.length == s1.length</code></li>
	<li><code>s1</code> and <code>s2</code> contain only lowercase letters from the set <code>{&#39;a&#39;, &#39;b&#39;, &#39;c&#39;, &#39;d&#39;, &#39;e&#39;, &#39;f&#39;}</code>.</li>
	<li><code>s2</code> is an anagram of <code>s1</code>.</li>
</ul>

class Solution {
public:
    int kSimilarity(string s1, string s2) {
        queue<string> q;
        unordered_map<string,int> mp;
        q.push(s1);
        int steps=0;
        mp[s1] = 1;
        while(!q.empty()){
            int sz = q.size();
            for(int i=0;i<sz;i++){
                string s = q.front();
                if(s==s2) return steps;
                q.pop();
                int id=s.size();
                for(int j=0;j<s.size();j++){
                    if(s[j]!=s2[j]){
                        id = j;
                        break;
                    }
                }
                int flag=0;
                for(int j=id+1;j<s.size();j++){
                    if(s2[j]==s[id] && s2[id]==s[j]){
                        swap(s[j],s[id]);
                        q.push(s);
                        flag=1;
                    }
                }
                if(flag) continue;
                for(int j=id+1;j<s.size();j++){
                    if(s2[id]==s[j]){
                        swap(s[j],s[id]);
                        q.push(s);
                        swap(s[j],s[id]);
                    }
                }
            }
            steps++;
        }
        return steps;
    }
};
26609