324. Rotate String

Given two strings s and goal, return true if and only if s can become goal after some number of shifts on s.

A shift on s consists of moving the leftmost character of s to the rightmost position.

For example, if s = "abcde", then it will be "bcdea" after one shift.

Example 1:

Input : s = "abcde" , goal = "cdeab"

Output : true

Explanation :

After performing 2 shifts we can achieve the goal string from string s.

After first shift the string s is => bcdea

After second shift the string s is => cdeab.

Example 2:

Input : s = "abcde" , goal = "adeac"

Output : false

Explanation :

Any number of shift operations cannot convert string s to string goal.

Now Your Turn!

Pick the correct output for the given input

Input : s = "abcde" , goal = "abcde"

Still unsure what the problem is asking ?

Letā€™s go through a few more examples, step by step, to make it clearer.

Constraints:

  • 1 <= s.length <= 100
  • 1 <= goal.length <= 100
  • s and goal consist of only lowercase English letters.

Fun Facts

0
class Solution{
public:
bool rotateString(string& s,string& goal){
//your code goes here
}
};
Test Case

Input:

Goal
S
to save your code