René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/maximum-repeating-substring","name":"#1668 - Maximum Repeating Substring - LeetCode JavaScript Solutions","description":"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-repea...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string} sequence\n * @param {string} word\n * @return {number}\n */\nvar maxRepeating = function(sequence, word) {\n let count = Math.floor(sequence.length / word.length) + 1;\n while (--count) {\n if (sequence.includes(word.repeat(count))) return count;\n }\n return count;\n};","keywords":"LeetCode 1668, #1668 - Maximum Repeating Substring, Easy, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}