Easy Python comment
Python\n\nclass Solution:\n    def smallestEquivalentString(self, s1: str, s2: str, baseStr: str) -> str:\n        val = string.ascii_lowercase\n        d = {x:
# Python\n```\nclass Solution:\n    def smallestEquivalentString(self, s1: str, s2: str, baseStr: str) -> str:\n        val = string.ascii_lowercase\n        d = {x: x for x in val}\n\n# Look up umtil we get d[x] == x, which is the lowest character lexi.\n        def find(x):\n            if d[x] == x: \n                return x\n            return find(d[x])\n\n        for a,b in zip(s1,s2):\n            l1, l2 = find(a),find(b)\n\n            if l1 > l2: \n                d[l1] = l2\n            else: \n                d[l2] = l1\n\n        return "".join([find(d[i]) for i in baseStr])\n```
['Hash Table', 'String', 'Depth-First Search', 'Union Find', 'Python3']