Smallest String With Swaps
You are given a string s, and an array of pairs of indices in the string pairs where pairs[i] = [a, b] indicates two 0-indexed indices of the string.
You can swap the characters at any pair of indices in the given pairs any number of times.
Return the lexicographically smallest string that s can be changed to after using the swaps.
Example 1
Input
s = "dcab", pairs = [[0,3],[1,2]]Output
"bacd"Swapping indices 0 and 3 gives
bcad, then swapping indices 1 and 2 gives bacd.Example 2
Input
s = "dcab", pairs = [[0,3],[1,2],[0,2]]Output
"abcd"Using the allowed swaps can transform
dcab into the lexicographically smallest string abcd.Constraints
- 1 <= s.length <= 10^5
- 0 <= pairs.length <= 10^5
- 0 <= pairs[i][0], pairs[i][1] < s.length
- s only contains lower case English letters.