Given two strings a and b, return the minimum number of times a must be repeated so that b becomes a substring of the repeated string. If no number of repetitions of a can make b a substring, return -1.

Implement the method int repeatedStringMatch(str a, str b).

Constraints:

• $1 \leq$ a.length, b.length $\leq 10^4$

• a and b consist of lowercase English letters.

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.