Leetcode 686. Repeated String Match

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).