<p>Two strings, <code>X</code> and <code>Y</code>, are considered similar if either they are identical or we can make them equivalent by swapping at most two letters (in distinct positions) within the string <code>X</code>.</p>

<p>For example, <code>&quot;tars&quot;</code>&nbsp;and <code>&quot;rats&quot;</code>&nbsp;are similar (swapping at positions <code>0</code> and <code>2</code>), and <code>&quot;rats&quot;</code> and <code>&quot;arts&quot;</code> are similar, but <code>&quot;star&quot;</code> is not similar to <code>&quot;tars&quot;</code>, <code>&quot;rats&quot;</code>, or <code>&quot;arts&quot;</code>.</p>

<p>Together, these form two connected groups by similarity: <code>{&quot;tars&quot;, &quot;rats&quot;, &quot;arts&quot;}</code> and <code>{&quot;star&quot;}</code>.&nbsp; Notice that <code>&quot;tars&quot;</code> and <code>&quot;arts&quot;</code> are in the same group even though they are not similar.&nbsp; Formally, each group is such that a word is in the group if and only if it is similar to at least one other word in the group.</p>

<p>We are given a list <code>strs</code> of strings where every string in <code>strs</code> is an anagram of every other string in <code>strs</code>. How many groups are there?</p>

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

<pre>
<strong>Input:</strong> strs = [&quot;tars&quot;,&quot;rats&quot;,&quot;arts&quot;,&quot;star&quot;]
<strong>Output:</strong> 2
</pre>

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

<pre>
<strong>Input:</strong> strs = [&quot;omv&quot;,&quot;ovm&quot;]
<strong>Output:</strong> 1
</pre>

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

<ul>
	<li><code>1 &lt;= strs.length &lt;= 300</code></li>
	<li><code>1 &lt;= strs[i].length &lt;= 300</code></li>
	<li><code>strs[i]</code> consists of lowercase letters only.</li>
	<li>All words in <code>strs</code> have the same length and are anagrams of each other.</li>
</ul>

class Solution {
public:
    vector<int> parent;
    int find(int x){
        if(parent[x]==x) return x;
        return parent[x] = find(parent[x]);
    }
    void unn(int x, int y){
        int a = find(x);
        int b = find(y);
        if( a!=b ){
            parent[a] = parent[b];
        }
    }
    bool check(string i, string j){
        if( i.size() != j.size() ) return 0;
        int diff=0;
        for( int k=0;k<i.size();k++){
            if(i[k]!= j[k]) diff++;
            if(diff > 2) return 0;
        }
        if(diff ==0 || diff == 2) return 1;
        return 0;
    }

    int numSimilarGroups(vector<string>& strs) {
        // unordered_map<string,int> umap;
        // int cc=0;
        // int subt=0;
        // for(auto i:strs){
        //     if(umap.find(i) != umap.end()){
        //         subt++;
        //         continue;
        //     }
        //     umap[i] = cc;
        //     cc++;
        // }
        int siz = strs.size();
        parent.resize(siz);
        for(int i=0;i<siz;i++){
            parent[i]=i;
        }
        for(int i=0;i<siz;i++){
            // int ii = umap[strs[i]];
            for(int j=0;j<siz;j++){
                // if(i==j) continue;
                // int jj = umap[strs[j]];
                // if(ii == jj) continue;
                if( check( strs[i] ,strs[j] ) ){
                    unn(i,j);
                }
            }
        }
        unordered_set<int> s;
        for(int i=0;i<siz;i++){
            int k = find(i);
            s.insert(k);
        }
        return s.size();
    }
};
205413