Given two strings s1 and s2, check whether s2 is a rotation of s1.
Input : ABACD, CDABA Output : True Input : GEEKS, EKSGE Output : True
We have discussed an approach in earlier post which handles substring match as a pattern. In this post, we will be going to use KMP algorithm’s lps (longest proper prefix which is also suffix) construction, which will help in finding the longest match of the prefix of string b and suffix of string a. By which we will know the rotating point, from this point match the characters. If all the characters are matched, then it is a rotation, else not.
Below is the basic implementation of the above approach.
Time Complexity : O(n)
Auxiliary Space : O(n)
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.
- A Program to check if strings are rotations of each other or not
- Check if two numbers are bit rotations of each other or not
- Check if all rows of a matrix are circular rotations of each other
- Check whether two strings are anagram of each other
- Check if two given strings are isomorphic to each other
- Check if two strings are permutation of each other
- Check whether two strings are anagrams of each other using unordered_map in C++
- Check if two strings can be made equal by swapping one character among each other
- Check whether all the rotations of a given number is greater than or equal to the given number or not
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Minimize count of given operations required to make two given strings permutations of each other
- Number of strings which starts and ends with same character after rotations
- Strings from an array which are not prefix of any other string
- Check if given string can be formed by two other strings or their permutations
- Quickly find multiple left rotations of an array | Set 1
- Minimum rotations required to get the same String | Set-2
- Replace two substrings (of a string) with each other
- Find maximum value of Sum( i*arr[i]) with only rotations on given array allowed
- Maximum sum of i*arr[i] among all rotations of a given array
- Count rotations divisible by 4
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : vt_m