Available question text
Find the minimum number of times string a must be concatenated with itself so that b appears as a contiguous substring of the result, or return -1 if impossible. Because of overlaps, you only need to consider a bounded number of repeats (roughly ceil(len(b)/len(a)) + 1).
Related questions
Continue with questions that share topics or the same question type.
- DI String Match
Coding
- Greedy Longest-Match Tokenization of a String Against a Fixed Vocabulary
Coding · String Algorithms
- A Graph question, a string question, a couple of array questions.
Coding
- Add Bold Tag in String
Coding
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 686. Repeated String Match
Reported date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source