Watch 10 video solutions for Rotate String, a easy level problem involving String, String Matching. This walkthrough by Ashish Pratap Singh has 1,002,140 views views. Want to try solving it yourself? Practice on FleetCode or read the detailed text solution.
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.
s = "abcde", then it will be "bcdea" after one shift.
Example 1:
Input: s = "abcde", goal = "cdeab" Output: true
Example 2:
Input: s = "abcde", goal = "abced" Output: false
Constraints:
1 <= s.length, goal.length <= 100s and goal consist of lowercase English letters.