<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:

    bool isSimilar(string s1, string s2) {
        int n = s1.size();
        int count = 0;
        for (int i = 0; i<n; i++){
            if(s1[i]!=s2[i]) {
                count++;
            }
            if(count>2) return false;
        }
        return true;
    }
    int find(int x) {
        if (parent[x]==-1) return x;
        return parent[x] = find(parent[x]);
    }
    void union1(int x, int y) {
        int p1 = find(x) ;
        int p2 = find(y);
        if(p1==p2) return;
        // if(height[p1]==height[p2]) {
        //     parent[p1] = p2;
        //     height[p2]++;
        // } else if (height[p1] > height[p2]) {
        //     parent[p2] = p1;
        // } else {
        //     parent[p1] = p2;
        // }
        if(height[p1]<height[p2]) {
            parent[p1] = p2;
            height[p2] += height[p1];
        } else {
            parent[p2]=p1;
            height[p1] += height[p2];
        }
        return;
    }

    vector<int> parent;
    vector<int> height;

    int numSimilarGroups(vector<string>& strs) {
        int n = strs.size();
        parent = vector<int> (n,-1);
        height = vector<int> (n,1);

        for (int i = 0 ; i < n ; i++) {
            string curr = strs[i];
            for (int j=i+1; j<n; j++) {
                string toMatch = strs[j];
                if (isSimilar(curr, toMatch)) {
                    union1(i,j);
                }
            }
        }

        int ans = 0;
        for(int i = 0; i<n; i++) {
            if (parent[i]==-1) ans++;
        }
        return ans;

    }
};
149258