Skip to content

Practice Minimum Number of Operations to Make Word K-Periodic

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#3137
LeetCode Problem

Minimum Number of Operations to Make Word K-Periodic

Problem Statement

You are given a string word of size n, and an integer k such that k divides n. In one operation, you can pick any two indices i and j, that are divisible by k, then replace the substring of length k starting at i with the substring of length k starting at j. That is, replace the substring word[i..i + k - 1] with the substring word[j..j + k - 1]. Return the minimum number of operations required to make word k-periodic. We say that word is k-periodic if there is some string s of length k such that word can be obtained by concatenating s an arbitrary number of times. For example, if word == “ababab”, then word is 2-periodic for s = "ab".

Source: Minimum Number of Operations to Make Word K-Periodic on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
word = "leetcodeleet", k = 4
Output
1

# Example 2

Input
word = "leetcoleet", k = 2
Output
3

Constraints

1 <= n == word.length <= 10^5
1 <= k <= word.length
k divides word.length.
word consists only of lowercase English letters.

Related LeetCode Problems

Practice more problems similar to Minimum Number of Operations to Make Word K-Periodic.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.