Python – Check if two strings are Rotationally Equivalent

Sometimes, while working with Python Strings, we can have problem in which we need to check if one string can be derived from other upon left or right rotation. This kind of problem can have application in many domains such as web development and competitive programming. Let’s discuss certain ways in which this task can be performed.

Input : test_str1 = ‘GFG’, test_str2 = ‘FGG’ 
Output : True 

Input : test_str1 = ‘Lazyroar’, test_str2 = ‘ksege’ 
Output : False

Method #1 : Using loop + string slicing The combination of above functions can be used to solve this problem. In this, we perform the task of extracting strings for performing all possible rotations, to check if any rotation equals the other string. 

The original string 1 is : Lazyroar
The original string 2 is : eksge
Are two strings Rotationally equal ? : True

Method #2 : Using any() + join() + enumerate() This is one of the ways in which this task can be performed. In this, we perform the task of checking any rotational equivalent using any() extracted using nested generator expression and enumerate(). 

The original string 1 is : Lazyroar
The original string 2 is : eksge
Are two strings Rotationally equal ? : True

Time Complexity: O(n)
Space Complexity: O(n)

Method #3: Using the inbuilt() function to check if two strings are Rotationally Equivalent

Step-by-step algorithm:

• Initialize two strings test_str1 and test_str2.
• Concatenate test_str1 with itself and check if test_str2 is a substring of it.
• If test_str2 is a substring of the concatenated string, then the strings are rotationally equivalent
• Print the result.

The original string 1 is : Lazyroar
The original string 2 is : eksge
Are two strings Rotationally equal ? : True

Time complexity: O(n), where n is the length of the concatenated string.
Auxiliary Space: O(n), where n is the length of the concatenated string.

Method #4: Using string concatenation and string search

Step-by-step approach:

• Initialize the two strings.
• Concatenate the first string with itself.
• Check if the second string is a substring of the concatenated string.
• If the second string is a substring, then the two strings are rotationally equivalent.
• Print the result.

The original string 1 is : Lazyroar
The original string 2 is : eksge
Are two strings Rotationally equal ? : True

Time complexity: O(n), where n is the length of the strings.
Auxiliary space: O(n), where n is the length of the strings