<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:
        
        dicto = {}
        for pair in pairs:
            if pair[0] not in dicto:
                dicto[pair[0]] = set()
            dicto[pair[0]].add(pair[1])
            if pair[1] not in dicto:
                dicto[pair[1]] = set()
            dicto[pair[1]].add(pair[0])



        comps = {}
        revcomps = {}

        cur = []
        newcur = []
        idx = -1

        for el in dicto:
            if el not in comps:
                cur = [el]
                newcur = []
                idx += 1
                while True:
                    if len(cur) == 0:
                        break
                    for el in cur:
                        for newel in dicto[el]:
                            if newel not in comps:
                                comps[newel] = idx
                                newcur.append(newel)
                
                    cur, newcur = newcur, []
        
        for el in comps:
            if comps[el] not in revcomps:
                revcomps[comps[el]] = []
            revcomps[comps[el]].append(s[el])

        for i in revcomps:
            revcomps[i].sort()
        
        oute = []
        coords = [0 for i in range(idx+1)]


        for i, letter in enumerate(s):
            if i not in comps:
                oute.append(letter)
            else:
                oute.append(revcomps[comps[i]][coords[comps[i]]])
                coords[comps[i]] += 1
        
        return ''.join(oute)

569