1668. Maximum Repeating Substring(Solution || Leetcode easy || Java)

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.

SOLUTION:

class Solution {
    public int maxRepeating(String sequence, String word) {
      String tbf = word;
      int ans = 0;
 
    //We are going to check if sequence contains word or not
    // and if it do then check if it contains 2 times word or not
    // and so on
        while(sequence.contains(tbf)){
            tbf += word;
            ans++;
        }
        
        return ans;
    }
}

Runtime: 1 ms, faster than 98.17% of Java online submissions for Maximum Repeating Substring.

Memory Usage: 40.7 MB, less than 86.61% of Java online submissions for Maximum Repeating Substring.

Thank you for reading. If you have any queries then, please let me know in the comment section. I will surely be responsive toward it.