Hard
Rotate String 274
Hard
32085 submissions
46 coins
+230 XP
Binary Search
Depth-First Search
Graph
Union Find
Problem Description
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 2 shifts, s becomes "cdeab".
```
## Example 2:
```
Input: s = "abcde", goal = "abced"
Output: false
```
## Constraints:
- `1 <= s.length, goal.length <= 100`
- `s` and `goal` consist of lowercase English letters.
Constraints
- `1 <= s.length, goal.length <= 100`
- `s` and `goal` consist of lowercase English letters.
Need help?
Connect with expert programmers for real-time collaborative coding, video meetings, and whiteboard sessions via CodeConnect.
Video Call
Whiteboard
Live Coding
Screen Share