problem no 61:(problem on strings):Check if strings are rotations of each other or not

 problem:

Check if strings are rotations of each other or not

Basic Accuracy: 49.96% Submissions: 13329 Points: 1

---

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.

code:

  public static boolean areRotations(String str1, String str2 )
    {
         return (str1.length() == str2.length()) && 
               ((str1 + str1).indexOf(str2) != -1); 
    }