Php Program for Minimum rotations required to get the same string
Given a string, we need to find the minimum number of rotations required to get the same string.
Input : s = "geeks" Output : 5 Input : s = "aaaa" Output : 1
The idea is based on below post.
Step 1 : Initialize result = 0 (Here result is count of rotations)
Step 2 : Take a temporary string equals to original string concatenated with itself.
Step 3 : Now take the substring of temporary string of size same as original string starting from second character (or index 1).
Step 4 : Increase the count.
Step 5 : Check whether the substring becomes equal to original string. If yes, then break the loop. Else go to step 2 and repeat it from the next index.
Time Complexity: O(n2)
Please refer complete article on Minimum rotations required to get the same string for more details!