Available question text
Given strings sequence and word, find the largest integer k such that word repeated k times (word^k) appears as a contiguous substring of sequence, returning 0 if word is not a substring. (Lengths ≤100.)
Related questions
Continue with questions that share topics or the same question type.
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 1668. Maximum Repeating Substring
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source