check rotation

Author: sachuverma

DSA Crack Sheet/README.md

@@ -59,6 +59,7 @@
 - [Palindrome String](https://practice.geeksforgeeks.org/problems/palindrome-string0817/1 "view question") - [Cpp Solution](./solutions/Palindrome%20String.cpp)
 - [Print all the duplicates in the input string](https://www.geeksforgeeks.org/print-all-the-duplicates-in-the-input-string/ "view topic")
 - [Why strings are immutable in Java?](https://javarevisited.blogspot.com/2010/10/why-string-is-immutable-or-final-in-java.html#:~:text=The%20string%20is%20Immutable%20in,cached%20in%20the%20String%20pool.&text=Since%20Strings%20are%20very%20popular,which%20was%20stored%20in%20HashMap. "view topic")
+- [Check if strings are rotations of each other or not](https://practice.geeksforgeeks.org/problems/check-if-strings-are-rotations-of-each-other-or-not-1587115620/1# "view question") - [Cpp Solution](./solutions/Check%20if%20strings%20are%20rotations%20of%20each%20other%20or%20not.cpp)
 - []( "view question") - [Cpp Solution](./solutions/.cpp)
 
 ### Searching & Sorting

DSA Crack Sheet/solutions/Check if strings are rotations of each other or not.cpp

@@ -0,0 +1,52 @@
+/*
+Check if strings are rotations of each other or not
+====================================================
+
+Given two strings s1 and s2. The task is to check if s2 is a rotated version of the string s1. The characters in the strings are in lowercase.
+
+Example 1:
+Input:
+geeksforgeeks
+forgeeksgeeks
+Output: 
+1
+Explanation: s1 is geeksforgeeks, s2 is
+forgeeksgeeks. Clearly, s2 is a rotated
+version of s1 as s2 can be obtained by
+left-rotating s1 by 5 units.
+
+Example 2:
+Input:
+mightandmagic
+andmagicmigth
+Output: 
+0
+Explanation: Here with any amount of
+rotation s2 can't be obtained by s1.
+
+Your Task:
+The task is to complete the function areRotations() which checks if the two strings are rotations of each other. The function returns true if string 1 can be obtained by rotating string 2, else it returns false.
+
+Expected Time Complexity: O(N).
+Expected Space Complexity: O(N).
+Note: N = |s1|.
+
+Constraints:
+1 <= |s1|, |s2| <= 107
+*/
+
+/*  Function to check if two strings are rotations of each other
+*   s1, s2: are the input strings
+*/
+bool areRotations(string s1, string s2)
+{
+  if (s1.size() != s2.size())
+    return false;
+  auto temp = s1 + s1;
+  for (int i = 0; i < temp.size(); ++i)
+  {
+    if (temp[i] == s2[0] && temp.substr(i, s2.size()) == s2)
+      return true;
+  }
+  return false;
+}