class Solution {
    // T: O(n^2)
    // S: O(n)
    public int maxRepeating(String sequence, String word) {
        if (!sequence.contains(word)) return 0;
        
        var quest = word;
        var count = 1;
            
        while (sequence.contains(quest)) {
            //concatenation of substring
            quest = quest + word;        
            if (sequence.contains(quest)) {
                //increment count only if substring is present
                count = count + 1;  
            }
        }
        
        return count;
    }
}