You are given a word and an integer k.
At every second, you must remove the first k characters of word and append any k lowercase English letters to the end of word.
Return the minimum time greater than word to revert to its initial state.
Note: The characters appended at each step can be chosen arbitrarily and do not need to match the removed characters.
Constraints:
word.length
k word.length
word consists only of lowercase English letters.
You are given a word and an integer k.
At every second, you must remove the first k characters of word and append any k lowercase English letters to the end of word.
Return the minimum time greater than word to revert to its initial state.
Note: The characters appended at each step can be chosen arbitrarily and do not need to match the removed characters.
Constraints:
word.length
k word.length
word consists only of lowercase English letters.