Add solution #1061

Author: JoshCrozier

README.md

@@ -1,4 +1,4 @@
-# 1,124 LeetCode solutions in JavaScript
+# 1,125 LeetCode solutions in JavaScript
 
 [https://leetcodejavascript.com](https://leetcodejavascript.com)
 
@@ -860,6 +860,7 @@
 1052|[Grumpy Bookstore Owner](./solutions/1052-grumpy-bookstore-owner.js)|Medium|
 1053|[Previous Permutation With One Swap](./solutions/1053-previous-permutation-with-one-swap.js)|Medium|
 1054|[Distant Barcodes](./solutions/1054-distant-barcodes.js)|Medium|
+1061|[Lexicographically Smallest Equivalent String](./solutions/1061-lexicographically-smallest-equivalent-string.js)|Medium|
 1071|[Greatest Common Divisor of Strings](./solutions/1071-greatest-common-divisor-of-strings.js)|Easy|
 1072|[Flip Columns For Maximum Number of Equal Rows](./solutions/1072-flip-columns-for-maximum-number-of-equal-rows.js)|Medium|
 1073|[Adding Two Negabinary Numbers](./solutions/1073-adding-two-negabinary-numbers.js)|Medium|

solutions/1061-lexicographically-smallest-equivalent-string.js

@@ -0,0 +1,57 @@
+/**
+ * 1061. Lexicographically Smallest Equivalent String
+ * https://leetcode.com/problems/lexicographically-smallest-equivalent-string/
+ * Difficulty: Medium
+ *
+ * You are given two strings of the same length s1 and s2 and a string baseStr.
+ *
+ * We say s1[i] and s2[i] are equivalent characters.
+ * - For example, if s1 = "abc" and s2 = "cde", then we have 'a' == 'c', 'b' == 'd', and 'c' == 'e'.
+ *
+ * Equivalent characters follow the usual rules of any equivalence relation:
+ * - Reflexivity: 'a' == 'a'.
+ * - Symmetry: 'a' == 'b' implies 'b' == 'a'.
+ * - Transitivity: 'a' == 'b' and 'b' == 'c' implies 'a' == 'c'.
+ *
+ * For example, given the equivalency information from s1 = "abc" and s2 = "cde", "acd" and "aab"
+ * are equivalent strings of baseStr = "eed", and "aab" is the lexicographically smallest equivalent
+ * string of baseStr.
+ *
+ * Return the lexicographically smallest equivalent string of baseStr by using the equivalency
+ * information from s1 and s2.
+ */
+
+/**
+ * @param {string} s1
+ * @param {string} s2
+ * @param {string} baseStr
+ * @return {string}
+ */
+var smallestEquivalentString = function(s1, s2, baseStr) {
+  const parent = Array(26).fill().map((_, i) => i);
+
+  for (let i = 0; i < s1.length; i++) {
+    union(s1.charCodeAt(i) - 97, s2.charCodeAt(i) - 97);
+  }
+
+  return baseStr.split('')
+    .map(char => String.fromCharCode(97 + find(char.charCodeAt(0) - 97)))
+    .join('');
+
+  function find(x) {
+    if (parent[x] !== x) {
+      parent[x] = find(parent[x]);
+    }
+    return parent[x];
+  }
+
+  function union(x, y) {
+    const rootX = find(x);
+    const rootY = find(y);
+    if (rootX < rootY) {
+      parent[rootY] = rootX;
+    } else if (rootX > rootY) {
+      parent[rootX] = rootY;
+    }
+  }
+};