Rotation Check
Easy
Given two strings, check if they are rotations of each other. Return 'true' if they are rotationally equivalent, otherwise return 'false'.
Example 1
Input
[ "abcde", "deabc" ]
Output
true
Explanation. The string 'deabc' is a rotation of 'abcde' starting from index 3.
Example 2
Input
[ "hello", "lohel" ]
Output
true
Explanation. The string 'lohel' is a rotation of 'hello' starting from index 3.
Example 3
Input
[ "coding", "ingcod" ]
Output
true
Explanation. The string 'ingcod' is a rotation of 'coding' starting from index 3.
Example 4
Input
[ "test", "estt" ]
Output
false
Explanation. Although 'estt' contains the same characters as 'test', the arrangement does not match any rotation of 'test'.
Follow-up: Can you improve your solution to run in O(n) time where n is the length of the longest string?
Constraints:
The input strings will only contain lower case alphabets and will have at least 1 character.
- Views
- 9