Add solution #1071

Author: JoshCrozier

README.md

@@ -262,6 +262,7 @@
 1022|[Sum of Root To Leaf Binary Numbers](./1022-sum-of-root-to-leaf-binary-numbers.js)|Easy|
 1037|[Valid Boomerang](./1037-valid-boomerang.js)|Easy|
 1041|[Robot Bounded In Circle](./1041-robot-bounded-in-circle.js)|Medium|
+1071|[Greatest Common Divisor of Strings](./1071-greatest-common-divisor-of-strings.js)|Easy|
 1081|[Smallest Subsequence of Distinct Characters](./1081-smallest-subsequence-of-distinct-characters.js)|Medium|
 1103|[Distribute Candies to People](./1103-distribute-candies-to-people.js)|Easy|
 1108|[Defanging an IP Address](./1108-defanging-an-ip-address.js)|Easy|

solutions/1071-greatest-common-divisor-of-strings.js

@@ -0,0 +1,26 @@
+/**
+ * 1071. Greatest Common Divisor of Strings
+ * https://leetcode.com/problems/greatest-common-divisor-of-strings/
+ * Difficulty: Easy
+ *
+ * For two strings s and t, we say "t divides s" if and only if s = t + t + t + ... + t + t
+ * (i.e., t is concatenated with itself one or more times).
+ *
+ * Given two strings str1 and str2, return the largest string x such that x divides both str1
+ * and str2.
+ */
+
+/**
+ * @param {string} str1
+ * @param {string} str2
+ * @return {string}
+ */
+var gcdOfStrings = function(str1, str2) {
+  if (str1 + str2 !== str2 + str1) return '';
+
+  for (let i = str2.length; i >= 0; i--) {
+    if (str1.length % i === 0 && str2.length % i === 0) {
+      return str1.substring(0, i);
+    }
+  }
+};