Blogs Hub

by Sumit Chourasia | Oct 17, 2020 | Category :coding | Tags : algorithm data-structure easy leetcode string

Rotate String - String - Easy - LeetCode

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)

Contributed By: Sumit Chourasia
Not Boring Movies - Sql - Easy - LeetCode
Contributed By: Sumit Chourasia
Next Permutation - Array - Medium - LeetCode
Contributed By: Sumit Chourasia
Merge Intervals - Array - Medium - LeetCode