Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Minimum rotations required to get the same string

  • Difficulty Level : Medium
  • Last Updated : 04 Oct, 2021

Given a string, we need to find the minimum number of rotations required to get the same string.
Examples: 
 

Input : s = "geeks"
Output : 5

Input : s = "aaaa"
Output : 1

 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

The idea is based on below post.
A Program to check if strings are rotations of each other or not
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. 
 
 



C++




// C++ program to determine minimum number
// of rotations required to yield same
// string.
#include <iostream>
using namespace std;
 
// Returns count of rotations to get the
// same string back.
int findRotations(string str)
{
    // tmp is the concatenated string.
    string tmp = str + str;
    int n = str.length();
 
    for (int i = 1; i <= n; i++) {
 
        // substring from i index of original
        // string size.
        string substring = tmp.substr(i, str.size());
 
        // if substring matches with original string
        // then we will come out of the loop.
        if (str == substring)
            return i;
    }
    return n;
}
 
// Driver code
int main()
{
    string str = "abc";
    cout << findRotations(str) << endl;
    return 0;
}
Java



// Java program to determine minimum number
// of rotations required to yield same
// string.
 
import java.util.*;
 
class GFG
{
    // Returns count of rotations to get the
    // same string back.
    static int findRotations(String str)
    {
        // tmp is the concatenated string.
        String tmp = str + str;
        int n = str.length();
     
        for (int i = 1; i <= n; i++)
        {
     
            // substring from i index of original
            // string size.
             
            String substring = tmp.substring(
                      i, i+str.length());
     
            // if substring matches with original string
            // then we will come out of the loop.
            if (str.equals(substring))
                return i;
        }
        return n;
    }
 
    // Driver Method
    public static void main(String[] args)
    {
            String str = "aaaa";
        System.out.println(findRotations(str));
    }
}
/* This code is contributed by Mr. Somesh Awasthi */
Python3



# Python 3 program to determine minimum
# number of rotations required to yield
# same string.
 
# Returns count of rotations to get the
# same string back.
def findRotations(str):
     
    # tmp is the concatenated string.
    tmp = str + str
    n = len(str)
 
    for i in range(1, n + 1):
         
        # substring from i index of
        # original string size.
        substring = tmp[i: i+n]
 
        # if substring matches with
        # original string then we will
        # come out of the loop.
        if (str == substring):
            return i
    return n
 
# Driver code
if __name__ == '__main__':
 
    str = "abc"
    print(findRotations(str))
 
# This code is contributed
# by 29AjayKumar.
C#



// C# program to determine minimum number
// of rotations required to yield same
// string.
using System;
 
class GFG {
     
    // Returns count of rotations to get
    // the same string back.
    static int findRotations(String str)
    {
         
        // tmp is the concatenated string.
        String tmp = str + str;
        int n = str.Length;
     
        for (int i = 1; i <= n; i++)
        {
     
            // substring from i index of
            // original string size.
             
            String substring =
                 tmp.Substring(i, str.Length);
     
            // if substring matches with
            // original string then we will
            // come out of the loop.
            if (str == substring)
                return i;
        }
         
        return n;
    }
 
    // Driver Method
    public static void Main()
    {
        String str = "abc";
         
        Console.Write(findRotations(str));
    }
}
 
// This code is contributed by nitin mittal.
PHP



<?php
// PHP program to determine minimum
// number of rotations required to
// yield same string.
 
// Returns count of rotations
// to get the same string back.
function findRotations($str)
{
    // tmp is the concatenated string.
    $tmp = ($str + $str);
    $n = strlen($str);
 
    for ( $i = 1; $i <= $n; $i++)
    {
 
        // substring from i index
        // of original string size.
        $substring = $tmp.substr($i,
                          strlen($str));
 
        // if substring matches with
        // original string then we will
        // come out of the loop.
        if ($str == $substring)
            return $i;
    }
    return $n;
}
 
// Driver code
$str = "abc";
echo findRotations($str), "\n";
 
// This code is contributed
// by Sachin
?>
Javascript



<script>
// javascript program to determine minimum number
// of rotations required to yield same
// string.
 
    // Returns count of rotations to get the
    // same string back.
    function findRotations( str) {
        // tmp is the concatenated string.
        var tmp = str + str;
        var n = str.length;
 
        for (var i = 1; i <= n; i++) {
 
            // substring from i index of original
            // string size.
 
            var substring = tmp.substring(i ,str.length);
 
            // if substring matches with original string
            // then we will come out of the loop.
            if (str===(substring))
                return i;
        }
        return n;
    }
 
    // Driver Method
     
        var str = "abc";
        document.write(findRotations(str));
 
// This code contributed by gauravrajput1
</script>
Output: 
 
3
Time Complexity: O(n2) 
Alternate Implementation in Python : 
 
Python3



# Python 3 program to determine minimum
# number of rotations required to yield
# same string.
  
# input
string = 'aaaa'
check = ''
  
for r in range(1, len(string)+1):
  # checking the input after each rotation
  check = string[r:] + string[:r]
    
  # following if statement checks if input is
  # equals to check , if yes it will print r and
  # break out of the loop
  if check == string:
    print(r)
    break
  
# This code is contributed
# by nagasowmyanarayanan.
Output: 
 
1
This article is contributed by Jatin Goyal. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 



My Personal Notes
arrow_drop_up
Previous
Generate all rotations of a given string
Next

A Program to check if strings are rotations of each other or not
Recommended Articles
Page :
Minimum rotations required to get the same String | Set-2
04, Jun 19
Number of strings which starts and ends with same character after rotations
21, May 20
Maximize count of corresponding same elements in given permutations using cyclic rotations
30, Jun 20
Count rotations required to sort given array in non-increasing order
09, Dec 20
Count of rotations required to generate a sorted array
20, Jun 20
Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
22, May 20
Minimum substring removals required to make all remaining characters of a string same
03, Jan 21
Generate all rotations of a given string
15, May 17
Rotations of a Binary String with Odd Value
06, Oct 18
Maximum contiguous 1 possible in a binary string after k rotations
20, Oct 18
Minimum number of pairs required to make two strings same
17, May 19
Minimum number of characters required to be removed such that every character occurs same number of times
22, Mar 21
Minimum adjacent swaps required to get Kth smallest number greater than given number
19, Oct 21
Minimize replacements by previous or next alphabet required to make all characters of a string the same
19, Oct 20
Minimize swaps of pairs of characters required such that no two adjacent characters in the string are same
09, Jul 21
Minimize the number of replacements to get a string with same number of 'a', 'b' and 'c' in it
15, Jan 19
Minimum changes required to make first string substring of second string
17, Oct 18
Minimum number of given operations required to convert a string to another string
07, Feb 19
Minimum cuts required to convert a palindromic string to a different palindromic string
12, Mar 19
Minimum increments by 1 or K required to convert a string into another given string
23, Feb 21
Minimum subsequences of a string A required to be appended to obtain the string B
03, Feb 21
Minimum count of prefixes and suffixes of a string required to form given string
28, Oct 21
A Program to check if strings are rotations of each other or not
26, May 09
Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed
17, Sep 15
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Medium





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!