Documentation Index
Fetch the complete documentation index at: /llms.txt
Use this file to discover all available pages before exploring further.
Tested Python solution for LeetCode 686 with 24 pytest cases. Generate a practice environment with lcpy.
lcpy gen -n 686 # by problem number
lcpy gen -s repeated_string_match # by problem name
a and b, return the minimum number of times you should repeat string a so that string b is a substring of it. If it is impossible for b to be a substring of a after repeating it, return -1.
Notice: string "abc" repeated 0 times is "", repeated 1 time is "abc" and repeated 2 times is "abcabc".
Input: a = "abcd", b = "cdabcdab"
Output: 3
Explanation: We return 3 because by repeating a three times "abcdabcdabcd", b is a substring of it.
Input: a = "a", b = "aa"
Output: 2
class Solution:
# Time: O(len(a) + len(b))
# Space: O(len(a) + len(b))
def repeated_string_match(self, a: str, b: str) -> int:
min_repeats = -(-len(b) // len(a)) if b else 1
for k in (min_repeats, min_repeats + 1):
if b in a * k:
return k
return -1
| Time | Space |
|---|---|
| O(len(a) + len(b)) | O(len(a) + len(b)) |