Blogs Hub

by Sumit Chourasia | Dec 02, 2020 | Category :coding | Tags : algorithm data-structure easy leetcode string

Maximum Repeating Substring - String - Easy - LeetCode

Maximum Repeating Substring - String - Easy - LeetCode

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.

 

Example 1:

Input: sequence = "ababc", word = "ab"
Output: 2
Explanation: "abab" is a substring in "ababc".
Example 2:

Input: sequence = "ababc", word = "ba"
Output: 1
Explanation: "ba" is a substring in "ababc". "baba" is not a substring in "ababc".
Example 3:

Input: sequence = "ababc", word = "ac"
Output: 0
Explanation: "ac" is not a substring in "ababc". 
 

Constraints:

1 <= sequence.length <= 100
1 <= word.length <= 100
sequence and word contains only lowercase English letters.

public class Solution {
    public int MaxRepeating(string sequence, string word) {
        var sb = new StringBuilder();
        int len = -1;
        while(sequence.Contains(sb.ToString())){
            len++;
            sb.Append(word);
        }
        
        return len;
    }
       
}

Time Complexity: O(n*m)

Space Complexity: O(n)