You are given a string word of length n and an integer k, where n is divisible by k.

In a single operation, you can choose two indices i and j such that both i and j are multiples of k, and replace the substring of length k starting at index i with the substring of length k starting at index j.

A string is considered k periodic if every non overlapping substring of length k is identical.

Return the minimum number of operations needed to make word k periodic.

Constraints:

• $1 \leq$ n $==$ word.length $\leq 10^5$

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

• k divides 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.