Please enter your email address or userHandle.
Given a string, check if it is a rotation of a palindrome. For example “aab” is a rotation of “aba”.
The first line contains T denoting the number of testcases. Then follows description of testcases.
Each case contains a string.
For each test case, output "1" if string is rotation of a palindrome otherwise "0" in a new line.
1<=Length of the string<=100
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.