<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:
        m = defaultdict(list)
        for i, j in pairs:
            m[i].append(j)
            m[j].append(i)
        def f(i, v):
            if v[i]: return []
            v[i] = True
            t = [i]
            for j in m[i]:
                t.extend(f(j, v))
            return t
        r = list(s)
        v = [False] * len(s)
        for i in range(len(s)):
            l1 = sorted(f(i, v))
            l2 = sorted([s[i] for i in l1])
            for i, c in zip(l1, l2):
                r[i] = c
        return ''.join(r)


        # p = [i for i in range(len(s))]
        # def find(i):
        #     if i != p[i]:
        #         p[i] = find(p[i])
        #     return p[i]
        # for i, j in pairs:
        #     i = find(i)
        #     j = find(j)
        #     if i != j:
        #         p[j] = i
        # m = defaultdict(list)
        # for i in range(len(s)):
        #     m[find(i)].append(i)
        # r = list(s)
        # for l1 in m.values():
        #     l2 = sorted([s[i] for i in l1])
        #     for i, c in zip(l1, l2):
        #         r[i] = c
        # return ''.join(r)
        
56698