GeezerVison

The World Wide Web, restored to 800 pixels of glory.

GeezerVison is showing leetcodejavascript.com — #1668 - Maximum Repeating Substring - LeetCode JavaScript Solutions

#1668 - Maximum Repeating Substring

Easy • View on LeetCode • View on GitHub

String Dynamic Programming String Matching

Problem 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-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.

Solution

/**
 * @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;
};

You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.