Question: 
Write a python function to find the minimum number of rotations required to get the same string.


Model's Code:
def find_Rotations(s: str) -> int:
    return len(s) if len(s) == 0 else len(s) // len(s.replace(s[0], '')) + 1



Sample Correct Code:
def find_Rotations(str): 
    tmp = str + str
    n = len(str) 
    for i in range(1,n + 1): 
        substring = tmp[i: i+n] 
        if (str == substring): 
            return i 
    return n 


Asserts:
assert find_Rotations("aaaa") == 1
assert find_Rotations("ab") == 2
assert find_Rotations("abc") == 3


Tests:
Test 1 of 3: FAIL: ZeroDivisionError('integer division or modulo by zero')

Test 9 of 974: 6/9 (66.66666666666666%): failed