human
Minimum rotations required to get the same string | Returns count of rotations to get the same string back ..
tmp is the concatenated string ..
substring from i index of original string size ..
if substring matches with original string then we will come out of the loop ..
Driver code"
How can the above be solved in Python?

Write me a code to minimum rotations required to get the same string and the other steps required?
assistant
#Here is code to minimum rotations required to get the same string and the other steps required.
 def findRotations ( 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
if __name__ == ' _ _ main _ _ ' :
	str = " abc "
	print ( findRotations ( str ) )