You are given a $0$ indexed string word and an integer k.

Every second, you must perform the following operation:

• Remove the first k characters from word.

• Append any k lowercase English characters to the end of word.

Return the minimum time greater than $0$ seconds needed for word to return to its original state.

Note: You can choose any characters to append at each step, and it is not required that they match the characters that were removed.

Constraints:

• $1 \leq$ word.length $\leq 50$

• $1 \leq$ k $\leq$ word.length

• word consists only 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.