Check String Rotation

Given two strings s₁ and s₂, determine whether s₂ is a rotation of s₁. A string s₂ is considered a rotation of s₁ if it can be obtained by taking some prefix of s₁ and moving it to the end of s₁. Formally, if s₁ has length n and there exists an integer k (with 0 ≤ k ≤ n) such that

\( s_2 = s_{1}[k:] + s_{1}[0:k] \)

Your task is to implement an efficient algorithm that checks this property using string operations. The recommended approach is to verify whether s₂ is a substring of s₁ + s₁.

inputFormat

The input consists of two lines:

• The first line contains the string s₁.
• The second line contains the string s₂.

Both strings contain only printable ASCII characters.

outputFormat

Output a single line containing True if s₂ is a rotation of s₁, and False otherwise.

waterbottle
erbottlewat

True