leetcode

0 class Solution {

1 public:

2 int minimumOperationsToMakeKPeriodic(const string &word, int k) const {

3 unordered_map<string, int> um;

4 const int n = size(word);

5 int maxi = 0;

6

7 for (int i = 0; i < n; i += k) {

8 maxi = max(maxi, ++um[word.substr(i, k)]);

9 }

10

11 return n / k - maxi;

12 }

13 };