<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:
        uf = UnionFind(len(s))
        # indices = []
        # for p in pairs:
        #     indices.extend(p)
        # print(indices)
        # indices = set(indices)

        for p in pairs:
            uf.union(p[0], p[1])
        print(uf.root, "uf.root")
        

        # insertpos = []
        # for r in uf.root:
        #     insertpos.append(uf.find(r))
        # print("insert position: ", insertpos)

        subs = defaultdict(list)
        for i in range (0, len(s)):
            k = uf.find(i)
            subs[k].append(s[i])
        print(subs)


        for k,v in subs.items():
            v.sort()
        print(subs)
        res = [""] * len(s)
        for i in range(0, len(s)):

            eleroot = uf.find(i)
            ele = subs[eleroot][0]
            res[i] += ele
            subs[eleroot].remove(ele)
        print(res)
        return "".join(res)





class UnionFind:
    def __init__(self, n):
        self.root = [0] * n
        self.rank = [1] * n
        for i in range(0, n):
            self.root[i] = i
    
    def find(self, x):
        while x != self.root[x]:
            x = self.root[x]
        return x
    
    def union(self, x, y):
        xroot = self.find(x)
        yroot = self.find(y)
        if xroot != yroot:
            xrank = self.rank[xroot]
            yrank = self.rank[yroot]
            if xrank > yrank:
                self.root[yroot] = xroot
            elif yrank > xrank:
                self.root[xroot] = yroot
            elif xrank == yrank:
                self.root[yroot] = xroot
                self.rank[xroot] += 1
        
843