File tree Expand file tree Collapse file tree 1 file changed +5
-24
lines changed
src/main/java/g3101_3200/s3137_minimum_number_of_operations_to_make_word_k_periodic Expand file tree Collapse file tree 1 file changed +5
-24
lines changed Original file line number Diff line number Diff line change @@ -30,33 +30,14 @@ We can obtain a 4-periodic string by picking i = 4 and j = 0. After this operati
3030
3131We can obtain a 2-periodic string by applying the operations in the table below.
3232
33- i
34-
35- j
36-
37- word
38-
39- 0
40-
41- 2
42-
43- etetcoleet
44-
45- 4
46-
47- 0
48-
49- etetetleet
50-
51- 6
52-
53- 0
54-
55- etetetetet
33+ i j word
34+ 0 2 etetcoleet
35+ 4 0 etetetleet
36+ 6 0 etetetetet
5637
5738** Constraints:**
5839
5940* <code >1 <= n == word.length <= 10<sup >5</sup ></code >
6041* ` 1 <= k <= word.length `
6142* ` k ` divides ` word.length ` .
62- * ` word ` consists only of lowercase English letters.
43+ * ` word ` consists only of lowercase English letters.
You can’t perform that action at this time.
0 commit comments