<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 Disjoint{
    public:
    vector<int>parent;
    vector<int>size;
    Disjoint(int n){
        parent.resize(n+1);
        size.resize(n+1,1);
        for(int i=0;i<n+1;i++){
            parent[i]=i;
        }
    }
    int findParent(int node){
        if(node==parent[node]){
            return node;
        }
        else return parent[node] = findParent(parent[node]);
    }
    void unionBySize(int u,int v){
        int ulp_v = findParent(v);
        int ulp_u = findParent(u);
        if(ulp_v == ulp_u){
            return;
        }
        if(size[ulp_v]>size[ulp_u]){
            parent[ulp_u] = ulp_v;
            size[ulp_v]+=size[ulp_u];
        }
        else{
            parent[ulp_v] = ulp_u;
            size[ulp_u] += size[ulp_v];
        }
    }
};
class Solution {
public:
    int numSimilarGroups(vector<string>& strs) {
        unordered_map<string,int>mp;
        int n=strs.size();
        Disjoint ds(strs.size()+1);
        sort(strs.begin(),strs.end());
        for(int i=0;i<n-1;i++){
            if(strs[i]==strs[i+1]){
                ds.unionBySize(i,i+1);
            }
        }
        for(int i=0;i<strs.size();i++){
            mp[strs[i]] = i;
        }
        for(int i=0;i<n;i++){
            // cout<<strs[i]<<" ->";
            for(int j=0;j<strs[i].length();j++){
                for(int k=j+1;k<strs[i].length();k++){
                    swap(strs[i][j],strs[i][k]);
                    // cout<<strs[i]<<" , ";
                    if(mp.find(strs[i])!=mp.end()){
                        ds.unionBySize(mp[strs[i]],i);
                    }
                    swap(strs[i][j],strs[i][k]);
                    // swap(strs[j],strs[k]);

                }
            }
            cout<<endl;
        }
        int cnt=0;
        for(int i=0;i<n;i++){
            // cout<<ds.findParent(i)<<" , ";
            if(ds.findParent(i)==i){
                cnt++;
            }
        }
        return cnt;

    }
};
16528