<p>You are given a string <code>s</code>, and an array of pairs of indices in the string&nbsp;<code>pairs</code>&nbsp;where&nbsp;<code>pairs[i] =&nbsp;[a, b]</code>&nbsp;indicates 2 indices(0-indexed) of the string.</p>

<p>You can&nbsp;swap the characters at any pair of indices in the given&nbsp;<code>pairs</code>&nbsp;<strong>any number of times</strong>.</p>

<p>Return the&nbsp;lexicographically smallest string that <code>s</code>&nbsp;can be changed to after using the swaps.</p>

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

<pre>
<strong>Input:</strong> s = &quot;dcab&quot;, pairs = [[0,3],[1,2]]
<strong>Output:</strong> &quot;bacd&quot;
<strong>Explaination:</strong> 
Swap s[0] and s[3], s = &quot;bcad&quot;
Swap s[1] and s[2], s = &quot;bacd&quot;
</pre>

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

<pre>
<strong>Input:</strong> s = &quot;dcab&quot;, pairs = [[0,3],[1,2],[0,2]]
<strong>Output:</strong> &quot;abcd&quot;
<strong>Explaination: </strong>
Swap s[0] and s[3], s = &quot;bcad&quot;
Swap s[0] and s[2], s = &quot;acbd&quot;
Swap s[1] and s[2], s = &quot;abcd&quot;</pre>

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

<pre>
<strong>Input:</strong> s = &quot;cba&quot;, pairs = [[0,1],[1,2]]
<strong>Output:</strong> &quot;abc&quot;
<strong>Explaination: </strong>
Swap s[0] and s[1], s = &quot;bca&quot;
Swap s[1] and s[2], s = &quot;bac&quot;
Swap s[0] and s[1], s = &quot;abc&quot;
</pre>

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

<ul>
	<li><code>1 &lt;= s.length &lt;= 10^5</code></li>
	<li><code>0 &lt;= pairs.length &lt;= 10^5</code></li>
	<li><code>0 &lt;= pairs[i][0], pairs[i][1] &lt;&nbsp;s.length</code></li>
	<li><code>s</code>&nbsp;only contains lower case English letters.</li>
</ul>

class Solution:
    def smallestStringWithSwaps(self, s: str, pairs: List[List[int]]) -> str:
        djs = disjointSet(len(s))
        res = ["" for i in range(len(s))]
        for pair in pairs:
            djs.union(pair[0], pair[1])
        
        parent = {}
        p2 = {}
        for i in range(len(s)):
            p = djs.find(i)
            p2[p] = p2.get(p, [])
            parent[p] = parent.get(p, [])
            parent[p].append(i)
            p2[p].append(s[i])
        
        for item in parent:
            parent[item].sort()
        for item in p2:
            p2[item].sort()

        for item in parent:
            x = parent[item]
            y = p2[item]

            for i in range(len(x)):
                res[x[i]] = y[i]

    
        return "".join(res)
        


class disjointSet:

    def __init__(self,n):
        self.root = [i for i in range(n)]
        self.rank = [0 for i in range(n)]
    

    def find(self, x):
        
        if self.root[x] == x:
            return x
        

        self.root[x] = self.find(self.root[x])
        return self.root[x]
    

    def union(self, a, b):
        A = self.find(a)
        B = self.find(b)

        if self.rank[A] > self.rank[B]:
            self.root[B] = A
        elif self.rank[B] > self.rank[A]:
            self.root[A] = B
        else:
            self.root[A] = B
            self.rank[B] += 1
    

        
510