Add solution #1668

Author: JoshCrozier

README.md

@@ -187,6 +187,7 @@
 1550|[Three Consecutive Odds](./1550-three-consecutive-odds.js)|Easy|
 1551|[Minimum Operations to Make Array Equal](./1551-minimum-operations-to-make-array-equal.js)|Medium|
 1598|[Crawler Log Folder](./1598-crawler-log-folder.js)|Easy|
+1668|[Maximum Repeating Substring](./1668-maximum-repeating-substring.js)|Easy|
 1780|[Check if Number is a Sum of Powers of Three](./1780-check-if-number-is-a-sum-of-powers-of-three.js)|Medium|
 1880|[Check if Word Equals Summation of Two Words](./1880-check-if-word-equals-summation-of-two-words.js)|Easy|
 1929|[Concatenation of Array](./1929-concatenation-of-array.js)|Easy|

solutions/1668-maximum-repeating-substring.js

@@ -0,0 +1,24 @@
+/**
+ * 1668. Maximum Repeating Substring
+ * https://leetcode.com/problems/maximum-repeating-substring/
+ * Difficulty: Easy
+ *
+ * For a string sequence, a string word is k-repeating if word concatenated k times is a substring
+ * of sequence. The word's maximum k-repeating value is the highest value k where word is k-repeating
+ * in sequence. If word is not a substring of sequence, word's maximum k-repeating value is 0.
+ *
+ * Given strings sequence and word, return the maximum k-repeating value of word in sequence.
+ */
+
+/**
+ * @param {string} sequence
+ * @param {string} word
+ * @return {number}
+ */
+var maxRepeating = function(sequence, word) {
+  let count = Math.floor(sequence.length / word.length) + 1;
+  while (--count) {
+    if (sequence.includes(word.repeat(count))) return count;
+  }
+  return count;
+};