Formatted question description:

796. Rotate String (Easy)

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


  • A and B will have length at most 100.

Apple, Microsoft

Solution 1.

// OJ:

// Time: O(N^2)
// Space: O(N)
class Solution {
    bool rotateString(string A, string B) {
        return A.size() == B.size() && (A + A).find(B) != string::npos;


class Solution {
    public boolean rotateString(String A, String B) {
        return A.length() == B.length() && (B + B).indexOf(A) >= 0;

All Problems

All Solutions