Rotate String - String - Easy - LeetCode

1 min read 126 words

sumitc9117 October 2020Updated: 17 October 2020 1 min read

ShareWhatsApp Post on X

1A shift on string A involves moving the leftmost character to the rightmost position.
2The function returns True if string A can become string B after some shifts.
3The time complexity of the solution is O(n) and the space complexity is O(n).

AI-generated summary · May not capture all nuances

Key Insight

AskGif

"A shift on string A involves moving the leftmost character to the rightmost position."

— Rotate String - String - Easy - LeetCode

We are given two strings, A and B.

A shift on A consists of taking string A and moving the leftmost character to the rightmost position. For example, if A = 'abcde', then it will be 'bcdea' after one shift on A. Return True if and only if A can become B after some number of shifts on A.

Example 1: Input: A = 'abcde', B = 'cdeab' Output: true

Example 2: Input: A = 'abcde', B = 'abced' Output: false Note:

A and B will have a length of at most 100.

public class Solution {
 public bool RotateString(string A, string B) {
 if(A.Length != B.Length){
 return false;
 }
 
 var str = A + A;
 return str.Contains(B);
 }
}

Time Complexity: O(n)

Space Complexity: O(n)

🛒 You'll Need This

Products related to this article