Leetcode 1061. Lexicographically Smallest Equivalent String

Given pairwise equivalences between characters in s1 and s2, compute character equivalence classes (e.g., with union-find) and replace each letter in baseStr with the smallest lexicographic character in its class to form the lexicographically smallest equivalent string. All strings consist of lowercase letters (lengths up to 1000).