Given two strings A and B, find the minimum number of times A has to be repeated such that B is a substring of it. If no such solution, return -1. For example, with A = "abcd" and B = "cdabcdab".
# Given two strings A and B, find the minimum number of times A has to be repeated # such that B is a substring of it. If no such solution, return -1. # For example, with A = "abcd" and B = "cdabcdab" ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback