Leetcode 1668. Maximum Repeating Substring
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.)
Question Timeline
See when this question was last asked and where, including any notes left by other candidates.
All Regions
Hello Interview Premium
Your account is free and you can post anonymously if you choose.