feat: add solutions to lc problems: No.3029

solution/3000-3099/3029.Minimum Time to Revert Word to Initial State I/Solution.py

@@ -5,6 +5,6 @@ def minimumTimeToInitialState(self, word: str, k: int) -> int:
             re = i * k
             if re >= n:
                 return i
-            if word[re:] == word[:n - re]:
+            if word[re:] == word[: n - re]:
                 return i
         return 0