Rotate String · Interview Problem

Back to problems

Leetcode

rotate-string

Medium

Strings

Two Pointers

Rotate String

Check if one string can become another string by rotating.

Acceptance 100%

Start Practice Editorial

Problem Statement

Core description from the backend problem record.

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. Determine if s can be rotated any number of times to become goal.

Input Format

Two strings s and goal.

Output Format

Boolean: true if s can be rotated to become goal, else false.

Constraints

1 <= s.length, goal.length <= 1000; s and goal consist of lowercase English letters.

Examples

Sample cases returned by the problem API.

Example 1

Input

s = "abcde", goal = "cdeab"

Output

true

Explanation

Rotate 'abcde' twice results in 'cdeab'.

Example 2