0 out of 464 challenges solved
Write a Python function `find_rotations(s: str) -> int` that determines the minimum number of rotations (greater than 0) required to return a string to its original form. A rotation involves moving the first character of the string to the end. #### Example Usage ```python [main.nopy] find_rotations("aaaa") # Output: 1 find_rotations("ab") # Output: 2 find_rotations("abc") # Output: 3 ``` #### Constraints - The input string will have a length of at least 1 and at most 1000 characters. - The string will consist of lowercase English letters only.
def find_rotations(s: str) -> int: """ Determine the minimum number of rotations required to return the string to its original form. Args: s (str): The input string. Returns: int: The minimum number of rotations. """ # Placeholder for the solution pass