Given two strings sequence and word, return the maximum integer $k$ such that word repeated $k$ times is a substring of sequence. If word is not a substring of sequence, return $0$.

Constraints:

• $1 \le$ sequence.length $\le 100$

• $1 \le$ word.length $\le 100$

• sequence and word contain only 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.