1071-greatest-common-divisor-of-strings

Author: AkifhanIlgaz

go/1071-greatest-common-divisor-of-strings..go

@@ -0,0 +1,37 @@
+package main
+
+import "strings"
+
+func main() {
+
+}
+
+func gcdOfStrings(str1 string, str2 string) string {
+	len1, len2 := len(str1), len(str2)
+	var isDivisor func(l int) bool
+
+	isDivisor = func(l int) bool {
+		if len1%l != 0 || len2%l != 0 {
+			return false
+		}
+
+		f1, f2 := len1/l, len2/l
+
+		return strings.Repeat(str1[:l], f1) == str1 && strings.Repeat(str1[:l], f2) == str2
+	}
+
+	for l := min(len1,len2); l > 0; l-- {
+		if isDivisor(l) {
+			return str1[:l]
+		}
+	}
+
+	return ""
+}
+
+func min( a,b int) int {
+	if a < b {
+		return a
+	}
+	return b
+}

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

@@ -0,0 +1,28 @@
+/**
+ * @param {string} str1
+ * @param {string} str2
+ * @return {string}
+ */
+var gcdOfStrings = function (str1, str2) {
+  let [len1, len2] = [str1.length, str2.length];
+
+  function isDivisor(l) {
+    if (len1 % l || len2 % l) {
+      return false;
+    }
+
+    let [f1, f2] = [Math.floor(len1 / l), Math.floor(len2 / l)];
+
+    return (
+      str1.slice(0, l).repeat(f1) == str1 && str1.slice(0, l).repeat(f2) == str2
+    );
+  }
+
+  for (let l = Math.min(len1, len2); l > 0; l--) {
+    if (isDivisor(l)) {
+      return str1.slice(0, l);
+    }
+  }
+
+  return "";
+};